Sciweavers

7167 search results - page 1050 / 1434
» Answer Set Programming
Sort
View
CP
2004
Springer
15 years 7 months ago
Unary Resource Constraint with Optional Activities
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Petr Vilím, Roman Barták, Ondrej Cep...
112
Voted
CIA
2006
Springer
15 years 7 months ago
Selecting Web Services Statistically
Abstract. Service oriented computing oers a new approach to programming. To be useful for large and diverse sets of problems, eective service selection and composition is crucial. ...
David Lambert, David Robertson
FPL
2006
Springer
66views Hardware» more  FPL 2006»
15 years 7 months ago
Minimizing Communication Cost for Reconfigurable Slot Modules
We discuss the problem of communication-aware module placement in array-like reconfigurable environments, such as the Erlangen Slot Machine (ESM). Bad placement of modules may deg...
Sándor P. Fekete, Jan van der Veen, Mateusz...
142
Voted
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 7 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
146
Voted
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 7 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
« Prev « First page 1050 / 1434 Last » Next »