Sciweavers

740 search results - page 90 / 148
» Open Answer Set Programming with Guarded Programs
Sort
View
UM
2001
Springer
14 years 13 days ago
Utility-Based Decision Tree Optimization: A Framework for Adaptive Interviewing
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
Markus Stolze, Michael Ströbel
ICALP
2009
Springer
14 years 18 days ago
On Observing Dynamic Prioritised Actions in SOC
We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and wea...
Rosario Pugliese, Francesco Tiezzi, Nobuko Yoshida
IPCO
2008
136views Optimization» more  IPCO 2008»
13 years 9 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza

Source Code
940views
15 years 9 months ago
Surface Rendering Using Vtk4.2 Qt3.x C++
This is an infrastructure code that integrates C++/Vt/Qt/Newmat into a cross-platform program that can run on any plateform Unix/Linux/Windows. For demo purposes, it loads any segm...
M. Sabry Hassouna
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar