8232 search results - page 331 / 1647 » Dynamic Logic Programming |
180
click to vote
SOSP
1997
ACM
15 years 8 months ago
1997
ACM
Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mi...
166
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
171
Voted
EUROGP
2006
Springer
15 years 10 months ago
2006
Springer
This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next st...
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...