477 search results - page 19 / 96 » Argumentation as distributed constraint satisfaction: applic... |
ECCC
2011
13 years 2 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
CONSTRAINTS
2008
13 years 7 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
VLSID
2007
IEEE
14 years 8 months ago
2007
IEEE
Performance of an application can be improved through augmenting the processor with Application specific Functional Units (AFUs). Usually a cluster of operations identified from th...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper we study the human eye movement and the head movement system as a simple mechanical control system. Most of the time, eye movements obey Listing's constraint, wh...
AAAI
2006
13 years 9 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...