Sciweavers

407 search results - page 21 / 82
» Optimization of Linear Logic Programs Using Counting Methods
Sort
View
IOR
2006
177views more  IOR 2006»
13 years 7 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
CCE
2005
13 years 7 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
HAPTICS
2002
IEEE
14 years 15 days ago
Optimal Design Method for Selective Nerve Stimulation and Its Application to Electrocutaneous Display
We have developed a tactile display that uses electric current from the skin surface as a stimulus. Our main objective was to independently stimulate a variety of mechanoreceptors...
Hiroyuki Kajimoto, Naoki Kawakami, Susumu Tachi
AICOM
2010
127views more  AICOM 2010»
13 years 7 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
CP
2004
Springer
14 years 29 days ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker