5180 search results - page 138 / 1036 » Concurrency, Time, and Constraints |
148
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
156
click to vote
CODES
2005
IEEE
16 years 3 days ago
2005
IEEE
Sensor network applications face continuously changing environments, which impose varying processing loads on the sensor node. This paper presents an online control method which a...
145
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
154
click to vote
CHI
2004
ACM
16 years 6 months ago
2004
ACM
In this paper we report a new approach to generating predictions about skilled interactive cognition. The approach, which we call Cognitive Constraint Modeling, takes as input a d...
152
click to vote
CPAIOR
2007
Springer
16 years 20 days ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...