Sciweavers

2109 search results - page 372 / 422
» Solving Necklace Constraint Problems
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 11 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
14 years 3 months ago
Resource allocation for signal detection with active sensors
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
Jerome Le Ny, Michael M. Zavlanos, George J. Pappa...
AI
1998
Springer
13 years 10 months ago
The Logical Foundations of Goal-Regression Planning in Autonomous Agents
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
John L. Pollock
WISEC
2009
ACM
14 years 5 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
ICS
2005
Tsinghua U.
14 years 4 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad