Sciweavers

14649 search results - page 206 / 2930
» Principles of problem solving
Sort
View
FLAIRS
2007
15 years 8 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
CP
2005
Springer
15 years 12 months ago
On Solving Soft Temporal Constraints Using SAT Techniques
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
Hossein M. Sheini, Bart Peintner, Karem A. Sakalla...
PAAMS
2009
Springer
15 years 11 months ago
A Realistic Approach to Solve the Nash Welfare
The multi-agent resource allocation problem is the negotiation of a set of resources among a population of agents, in order to maximize a social welfare function. The purpose of th...
Antoine Nongaillard, Philippe Mathieu, Brigitte Ja...
FLAIRS
2003
15 years 7 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin