Sciweavers

1968 search results - page 292 / 394
» The Complexity of Valued Constraint Models
Sort
View
COR
2008
99views more  COR 2008»
14 years 10 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
IVC
2008
138views more  IVC 2008»
14 years 10 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
EOR
2007
93views more  EOR 2007»
14 years 10 months ago
Contour line construction for a new rectangular facility in an existing layout with rectangular departments
In a recent paper, Savas, Batta and Nagi [14] consider the optimal placement of a finite-sized facility in the presence of arbitrarily-shaped barriers under rectilinear travel. T...
Hari Kelachankuttu, Rajan Batta, Rakesh Nagi
TON
2008
86views more  TON 2008»
14 years 9 months ago
Securing user-controlled routing infrastructures
Designing infrastructures that give untrusted third parties (such as end-hosts) control over routing is a promising research direction for achieving flexible and efficient communic...
Karthik Lakshminarayanan, Daniel Adkins, Adrian Pe...
MTA
2007
111views more  MTA 2007»
14 years 9 months ago
Story creation from heterogeneous data sources
There are numerous applications where there is a need to rapidly infer a story about a given subject from a given set of potentially heterogeneous data sources. In this paper, we f...
Marat Fayzullin, V. S. Subrahmanian, Massimiliano ...