Sciweavers

832 search results - page 29 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
IANDC
2008
92views more  IANDC 2008»
14 years 9 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
PACT
1999
Springer
15 years 1 months ago
Parallel Implementation of Constraint Solving
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
Alvaro Ruiz-Andino, Lourdes Araujo, Fernando S&aac...
88
Voted
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
93
Voted
DAC
2004
ACM
15 years 10 months ago
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
Chun-Gi Lyuh, Taewhan Kim
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
14 years 10 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya