4117 search results - page 254 / 824 » On the Satisfiability of Complex Constraints |
178
click to vote
TMC
2008
15 years 6 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
186
click to vote
JSAC
2011
15 years 1 months ago
2011
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
184
click to vote
AI
2003
Springer
15 years 12 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
179
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
194
click to vote
JWSR
2007
15 years 6 months ago
2007
: A major challenge for Service–oriented Computing is how to discover and compose (Web) services to build complex applications. We present a matchmaking system that exploits both...