Sciweavers

548 search results - page 101 / 110
» A quantified distributed constraint optimization problem
Sort
View
NIPS
2004
15 years 4 months ago
Discrete profile alignment via constrained information bottleneck
Amino acid profiles, which capture position-specific mutation probabilities, are a richer encoding of biological sequences than the individual sequences themselves. However, profi...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
JAIR
2008
110views more  JAIR 2008»
15 years 3 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
TMC
2008
146views more  TMC 2008»
15 years 2 months ago
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
In multihop wireless sensor networks that are often characterized by many-to-one (convergecast) traffic patterns, problems related to energy imbalance among sensors often appear. S...
Zhao Cheng, Mark A. Perillo, Wendi B. Heinzelman
JSAC
2007
132views more  JSAC 2007»
15 years 2 months ago
Lifetime maximization via cooperative nodes and relay deployment in wireless networks
— Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative co...
Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han...
IPPS
2003
IEEE
15 years 8 months ago
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...