2376 search results - page 172 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
IOR
2008
13 years 8 months ago
2008
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
EDBTW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
FAC
2008
13 years 8 months ago
2008
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
TSP
2008
13 years 7 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...