Sciweavers

1022 search results - page 5 / 205
» Challenges for Constraint Programming in Networking
Sort
View
ILP
2005
Springer
14 years 28 days ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
ADAEUROPE
2007
Springer
14 years 1 months ago
Towards the Testing of Power-Aware Software Applications for Wireless Sensor Networks
The testing of programs in wireless sensor networks (WSN) is an important means to assure quality but is a challenging process. As pervasive computing has been identified as a not...
W. K. Chan, Tsong Yueh Chen, S. C. Cheung, T. H. T...
IPSN
2007
Springer
14 years 1 months ago
Building a sensor network of mobile phones
Mobile phones have two sensors: a camera and a microphone. The widespread and ubiquitous nature of mobile phones around the world makes it attractive to build a large-scale sensor...
Aman Kansal, Michel Goraczko, Feng Zhao
CONSTRAINTS
2010
153views more  CONSTRAINTS 2010»
13 years 4 months ago
Philosophy of the MiniZinc challenge
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes...
Peter J. Stuckey, Ralph Becket, Julien Fischer
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
13 years 4 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier