68 search results - page 4 / 14 » A Reach and Bound algorithm for acyclic dynamic-programming ... |
SOFSEM
2007
Springer
14 years 12 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
SPDP
1991
IEEE
13 years 9 months ago
1991
IEEE
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
ICONIP
2004
13 years 7 months ago
2004
Abstract. This paper presents a neural-evolutionary framework for the simulation of market models in a bounded rationality scenario. Each agent involved in the scenario make use of...
ICCAD
2006
IEEE
14 years 3 months ago
2006
IEEE
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...