Sciweavers

874 search results - page 110 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
DISOPT
2007
93views more  DISOPT 2007»
15 years 2 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi
104
Voted
ECSCW
2001
15 years 4 months ago
On finding things out: Situating organisational knowledge in CSCW
We present a field study of an organisation which designs and constructs precision mechatronic devices, which typically integrate electronics, mechanical assemblies, computer hardw...
Kristina Groth, John Bowers
130
Voted
EMMCVPR
2005
Springer
15 years 8 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
100
Voted
TOG
2008
96views more  TOG 2008»
15 years 2 months ago
Display adaptive tone mapping
We propose a tone-mapping operator that can minimize visible contrast distortions for a range of output devices, ranging from e-paper to HDR displays. The operator weights contras...
Rafal Mantiuk, Scott Daly, Louis Kerofsky
111
Voted
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
15 years 7 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...