1381 search results - page 224 / 277 » Computational Complexity of Constraint Satisfaction |
AINA
2004
IEEE
13 years 11 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
ARC
2008
Springer
13 years 9 months ago
2008
Springer
As embedded applications are getting more complex, they are also demanding highly diverse computational capabilities. The majority of all previously proposed reconfigurable archite...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
BICOB
2010
Springer
13 years 8 months ago
2010
Springer
Biomarker discovery for complex diseases is a challenging problem. Most of the existing approaches identify individual genes as disease markers, thereby missing the interactions a...