949 search results - page 99 / 190 » Theory of Constraints |
129
Voted
CP
2011
Springer
14 years 15 days ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
DIS
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...
114
Voted
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
Although more efficient in computation compared to other tracking approaches such as particle filtering, the kernel-based tracking suffers from the "singularity" problem...
102
click to vote
FROCOS
2007
Springer
15 years 6 months ago
2007
Springer
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
105
click to vote
ENTCS
2006
15 years 21 days ago
2006
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...