11 search results - page 2 / 3 » Reducing Epistasis in Combinatorial Problems by Expansive Co... |
WEA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
ISSAC
1994
Springer
13 years 9 months ago
1994
Springer
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
COMPSAC
2004
IEEE
13 years 9 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
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...
ICCL
1998
IEEE
13 years 9 months ago
1998
IEEE
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...