17770 search results - page 273 / 3554 » A Generalization of Forward-Backward Algorithm |
207
click to vote
GECCO
2003
Springer
16 years 11 days ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
179
Voted
ISLPED
2000
ACM
15 years 11 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...
223
Voted
AAIM
2007
Springer
15 years 11 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...
160
click to vote
SODA
2004
ACM
15 years 8 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 ...
191
click to vote
CASCON
1996
15 years 8 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...