478 search results - page 9 / 96 » Local Search for Computing Normal Circumstances Models |
CP
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
CIA
2007
Springer
14 years 4 months ago
2007
Springer
We introduce the Consensual N-Player Prisoner’s Dilemma as a large-scale dilemma. We then present a framework for cooperative consensus formation in large-scale MAS under the N-P...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
CPAIOR
2010
Springer
14 years 3 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
DFVLR
1987
14 years 1 months ago
1987
: This paper examines the argument for dataflow architectures in "Two Fundamental Issues in Multiprocessing[5]." We observe two key problems. First, the justification of ...