Sciweavers

14158 search results - page 296 / 2832
» Generalized switch-setting problems
Sort
View
AAAI
2006
15 years 5 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
ATAL
2010
Springer
15 years 5 months ago
Assignment problem in requirements driven agent collaboration and its implementation
Requirements Driven Agent Collaboration (RDAC) is a mechanism where the self-interested service agents actively and autonomously search for the required services submitted by the ...
Jian Tang, Zhi Jin
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 5 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 4 months ago
Detecting Coordination Problems in Collaborative Software Development Environments
Software development is rarely an individual effort and generally involves teams of developers collaborating to generate good reliable code. Among the software code there exist te...
Chintan Amrit, Jos van Hillegersberg
CC
2007
Springer
158views System Software» more  CC 2007»
15 years 4 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner