774 search results - page 62 / 155 » Process Discovery Using Integer Linear Programming |
135
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
136
click to vote
ALMOB
2006
15 years 2 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
100
click to vote
EUROGP
2004
Springer
15 years 7 months ago
2004
Springer
Despite considerable progress in GP over the past 10 years, there are many outstanding challenges that need to be addressed before it will be widely deployed for developing useful ...
106
click to vote
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
118
click to vote
JKM
2006
15 years 2 months ago
2006
Purpose Knowledge management for space exploration is part of a multi-generational effort. Each mission builds on knowledge from prior missions, and learning is the first step in ...