Sciweavers

430 search results - page 50 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
ICSAP
2010
15 years 2 months ago
EEMLA: Energy Efficient Monitoring of Wireless Sensor Network with Learning Automata
— When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field (referred to as a "cover"), while the rest of the sensors ...
Habib Mostafaei, Mohammad Reza Meybodi, Mehdi Esna...
CP
2000
Springer
15 years 3 months ago
Singleton Consistencies
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
Patrick Prosser, Kostas Stergiou, Toby Walsh
ESOP
1999
Springer
15 years 2 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
15 years 3 months ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
PVLDB
2010
152views more  PVLDB 2010»
14 years 9 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...