920 search results - page 142 / 184 » Generating Satisfiable Problem Instances |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider wireless sensor networks with multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joi...
IUI
2003
ACM
14 years 29 days ago
2003
ACM
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on PDAs or cell phones or by disabled users) by taking a...
FOCS
2000
IEEE
14 years 4 days ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
IPPS
2000
IEEE
14 years 3 days ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
AAAI
2008
13 years 10 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...