Sciweavers

6554 search results - page 409 / 1311
» Constraint Logic Programming
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
JCP
2008
178views more  JCP 2008»
15 years 6 months ago
Building Design Optimization Using Sequential Linear Programming
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
Rekha Bhowmik
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 6 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
RTAS
2009
IEEE
16 years 1 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...
NA
2010
82views more  NA 2010»
15 years 5 months ago
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
Matthew M. Lin, Bo Dong, Moody T. Chu