Sciweavers

2968 search results - page 424 / 594
» Network Programming Using PLAN
Sort
View
EOR
2006
134views more  EOR 2006»
15 years 5 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
158
Voted
IOR
2007
82views more  IOR 2007»
15 years 4 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
152
Voted
FGCS
2000
93views more  FGCS 2000»
15 years 4 months ago
Sharing objects in a distributed, single address space environment
With reference to an object type defining the two basic operations, read and write, we present solutions to the object sharing problem, classified according to the migration and/o...
Gianluca Dini, Lanfranco Lopriore
TOPLAS
2008
79views more  TOPLAS 2008»
15 years 3 months ago
Witnessing side effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alex Aiken
152
Voted
ANOR
2011
96views more  ANOR 2011»
14 years 12 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder