Sciweavers

1480 search results - page 220 / 296
» Ants can solve constraint satisfaction problems
Sort
View
JSAC
2010
116views more  JSAC 2010»
14 years 6 months ago
Utility-based asynchronous flow control algorithm for wireless sensor networks
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...
Jiming Chen, WeiQiang Xu, Shibo He, Youxian Sun, P...
WG
1994
Springer
15 years 4 months ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...
CP
2006
Springer
15 years 3 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann
IJCAI
1997
15 years 1 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
ICC
2008
IEEE
175views Communications» more  ICC 2008»
15 years 6 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...