17760 search results - page 237 / 3552 » A Generalization of the Massey-Ding Algorithm |
134
click to vote
ISLPED
2000
ACM
15 years 9 months ago
2000
ACM
We introduce the notion of energy scalable computation on general purpose processors. The principle idea is to maximize computational quality for a given energy constraint. The de...
163
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
115
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
148
click to vote
CASCON
1996
15 years 6 months ago
1996
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...
111
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we describe an improvement of an entropy-based diversity preservation approach for evolutionary algorithms. This approach exploits the information contained not only...