16091 search results - page 267 / 3219 » Solving |
188
click to vote
AADEBUG
2000
Springer
15 years 11 months ago
2000
Springer
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
188
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
145
click to vote
EH
2004
IEEE
15 years 10 months ago
2004
IEEE
Intrinsic evolution is often limited to using standard electronic components as the media for problem solving. It has been argued that because such components are human designed a...
143
click to vote
OPODIS
2008
15 years 8 months ago
2008
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
167
click to vote
RIVF
2008
15 years 8 months ago
2008
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()