Sciweavers

6554 search results - page 1048 / 1311
» Constraint Logic Programming
Sort
View
122
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 4 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
EOR
2008
133views more  EOR 2008»
15 years 4 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar
162
Voted
CN
2006
145views more  CN 2006»
15 years 4 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
ENDM
2006
69views more  ENDM 2006»
15 years 4 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
DISOPT
2007
155views more  DISOPT 2007»
15 years 4 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
« Prev « First page 1048 / 1311 Last » Next »