9719 search results - page 398 / 1944 » Answer Set Optimization |
187
Voted
ICMAS
2000
15 years 8 months ago
2000
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts--i.e., contracts where each party ca...
183
Voted
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
212
Voted
COMGEO
2008
ACM
15 years 7 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
230
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
189
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...