Sciweavers

1697 search results - page 194 / 340
» On Bayesian Case Matching
Sort
View
CIA
2006
Springer
14 years 1 months ago
Eliminating Interdependencies Between Issues for Multi-issue Negotiation
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...
COMPGEOM
2001
ACM
14 years 1 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ECIS
2004
13 years 11 months ago
Information system and information infrastructure deployment: the challenge of the Italian e-justice approach
Information systems development methodologies are still mainly concerned with the research of better ways to provide technical solutions for given organizational problems. The pap...
Francesco Contini, Antonio Cordella
DISOPT
2006
155views more  DISOPT 2006»
13 years 9 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin