Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
569
Intelligent agents: Theory and practice
- The Knowledge Engineering Review
, 1995
"... The concept of an agent has become important in both Artificial Intelligence (AI) and mainstream computer science. Our aim in this paper is to point the reader at what we perceive to be the most important theoretical and practical issues associated with the design and construction of intelligent age ..."
Abstract
-
Cited by 1441 (85 self)
- Add to MetaCart
agents. For convenience, we divide these issues into three areas (though as the reader will see, the divisions are at times somewhat arbitrary). Agent theory is concerned with the question of what an agent is, and the use of mathematical formalisms for representing and reasoning about the properties
An automata-theoretic approach to linear temporal logic
- Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science
, 1996
"... Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over s ..."
Abstract
-
Cited by 295 (26 self)
- Add to MetaCart
. Unlike classical automata theory, which focused on automata on finite words, the applications to program specification, verification, and synthesis, use automata on infinite words, since the computations in which we are interested are typically infinite. This paper provides an introduction to the theory
Unification and Matching modulo Nilpotence
- In Proc. CADE-13, volume 1104 of LNCS
, 1996
"... . We consider equational unification and matching problems where the equational theory contains a nilpotent function, i.e., a function f satisfying f(x;x) = 0 where 0 is a constant. Nilpotent matching and unification are shown to be NP-complete. In the presence of associativity and commutativity, t ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
. We consider equational unification and matching problems where the equational theory contains a nilpotent function, i.e., a function f satisfying f(x;x) = 0 where 0 is a constant. Nilpotent matching and unification are shown to be NP-complete. In the presence of associativity and commutativity
On Decidability of Unifiability modulo Rewrite Systems
, 1996
"... . The goal of this paper is to study the decidability of unifiability in theories represented by confluent constructor-based rewrite systems. We propose four additional restrictions on the rewrite system and the goal to be unified, and show that if only three of them are satisfied then unifiability ..."
Abstract
- Add to MetaCart
is undecidable. Then we give a decision algorithm applicable when the four restrictions are satisfied. This algorithm generates a new kind of tree grammar as finite representation for the (possibly infinite) set of solutions. 1 Introduction Constraint Programming has known an intensive development in the last
Acceleration of Satisfiability Algorithms by Reconfigurable Hardware
- In International Workshop on Field-Programmable Logic and Applications (FPL
, 1998
"... . We present different architectures to solve Boolean satisfiability problems in instance-specific hardware. A simulation of these architectures shows that for examples from the DIMACS benchmark suite, high raw speed-ups over software can be achieved. We present a design tool flow and prototype ..."
Abstract
-
Cited by 18 (3 self)
- Add to MetaCart
technology. 1 Introduction The Boolean satisfiability problem (SAT) is a fundamental problem in mathematical logic and computing theory with many practical applications in areas such as computer-aided design of digital systems, automated reasoning, and machine vision. In computer-aided design, tools
An Entropy Satisfying Muscl Scheme for Systems of Conservation Laws
, 1996
"... . For the high order numerical approximation of hyperbolic systems of conservation laws, we propose to use as a building principle an entropy diminishing criterion instead of the familiar total variation diminishing criterion introduced by Harten for scalar equations. Based on this new criterion, we ..."
Abstract
-
Cited by 12 (4 self)
- Add to MetaCart
scheme is proved for systems of two equations. Numerical tests demonstrate the interest of our theory. Contents 1. Introduction 2. General Framework 2.1 A Class of High Order Schemes 2.2 Entropy Diminishing Projections 2.3 Discrete Entropy Inequalities 3. Applications 3.1 Linear Hyperbolic Systems 3
Noncommutative Schur Functions and their Applications
"... We develop a theory of Schur functions in noncommuting variables, assuming commutation relations that are satisfied in many well-known associative algebras. As an application of our theory, we prove Schur-positivity and obtain generalized Littlewood-Richardson and Murnaghan-Nakayama rules for a larg ..."
Abstract
-
Cited by 61 (1 self)
- Add to MetaCart
We develop a theory of Schur functions in noncommuting variables, assuming commutation relations that are satisfied in many well-known associative algebras. As an application of our theory, we prove Schur-positivity and obtain generalized Littlewood-Richardson and Murnaghan-Nakayama rules for a
Data Compression
- ACM Computing Surveys
, 1987
"... This paper surveys a variety of data compression methods spanning almost forty years of research, from the work of Shannon, Fano and Huffman in the late 40's to a technique developed in 1986. The aim of data compression is to reduce redundancy in stored or communicated data, thus increasing eff ..."
Abstract
-
Cited by 101 (5 self)
- Add to MetaCart
effective data density. Data compression has important application in the areas of file storage and distributed systems. Concepts from information theory, as they relate to the goals and evaluation of data compression methods, are discussed briefly. A framework for evaluation and comparison of methods
The Theory Of Generalized Dirichlet Forms And Its Applications In Analysis And Stochastics
, 1996
"... We present an introduction (also for non-experts) to a new framework for the analysis of (up to) second order differential operators (with merely measurable coefficients and in possibly infinitely many variables) on L²-spaces via associated bilinear forms. This new framework, in particular, covers b ..."
Abstract
-
Cited by 41 (1 self)
- Add to MetaCart
forms are symmetric and coercive Dirichlet forms (cf. [FOT], [MR1]) as well as time dependent Dirichlet forms (cf. [O1]). We discuss many applications to differential operators that can be treated within the new framework only, e.g. parabolic differential operators with unbounded drifts satisfying no L
Order An Introduction to Probability Theory and Its Applications by Feller from Amazon, and you
"... This paper considers inventory models with advance demand information and flexible delivery. Customers place their orders in advance, and delivery is flexible in the sense that early shipment is allowed. Specifically, an order placed at time t by a customer with demand leadtime T should be fulfilled ..."
Abstract
- Add to MetaCart
be fulfilled by period t+T; failure to fulfill it within the time window [t, t+T] is penalized. We consider two situations: (1) customer demand leadtimes are homogeneous and demand arriving in period t is a scalar dt to be satisfied within T periods. We show that state-dependent (s,S) policies are optimal
Results 1 - 10
of
569
