Sciweavers

10 search results - page 1 / 2
» Linear bilevel programming with upper level constraints depe...
Sort
View
AMC
2006
107views more  AMC 2006»
13 years 4 months ago
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
Ayalew Getachew Mersha, Stephan Dempe
ACL
1992
13 years 5 months ago
Estimating Upper and Lower Bounds on the Performance of Word-Sense Disambiguation Programs
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
William A. Gale, Kenneth Ward Church, David Yarows...
HICSS
2005
IEEE
131views Biometrics» more  HICSS 2005»
13 years 10 months ago
Train Traffic Deviation Handling Using Tabu Search and Simulated Annealing
This paper addresses the problem of solving conflicts in railway traffic that arise due to disturbances. It is formulated as a problem of re-scheduling meets and overtakes of trai...
Johanna Törnquist, Jan A. Persson
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
13 years 8 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
ICLP
2004
Springer
13 years 9 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir