33 search results - page 6 / 7 » Unbiased Branches: An Open Problem |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
RIDE
2002
IEEE
13 years 10 months ago
2002
IEEE
Technologies and approaches in the field of Electronic Commerce are not mature enough in order to allow for their broad successful commercial application. Neither existing, succes...
ADHOCNETS
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we consider the use of multiple mobile software agents to perform different tasks in wireless sensor networks (WSNs). To this regard, determining the number of mobil...
AI
2010
Springer
13 years 5 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
AGP
2010
IEEE
13 years 10 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...