Sciweavers

2636 search results - page 179 / 528
» Linear Programming
Sort
View
ORL
2000
77views more  ORL 2000»
15 years 2 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
CCE
2008
15 years 2 months ago
Simultaneous targeting and design for cooling water systems with multiple cooling water supplies
This paper presents a technique for simultaneous targeting and design in cooling water systems comprising of at least two cooling towers and several cooling water using operations...
Thokozani Majozi, Anand Moodley
ICLP
2005
Springer
15 years 8 months ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
EVOW
2003
Springer
15 years 7 months ago
Pixel Statistics and False Alarm Area in Genetic Programming for Object Detection
This paper describes a domain independent approach to the use of genetic programming for object detection problems. Rather than using raw pixels or high level domain specific feat...
Mengjie Zhang, Peter Andreae, Mark Pritchard
LPNMR
2001
Springer
15 years 7 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel