413 search results - page 5 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
CODES
2010
IEEE
13 years 5 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
AIPS
2010
13 years 8 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
LCN
2006
IEEE
14 years 1 months ago
2006
IEEE
There is increasing research interest in solving routing problems in sensor networks subject to constraints such as data correlation, link reliability and energy conservation. Sin...
QSHINE
2005
IEEE
14 years 20 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...