Sciweavers

5316 search results - page 180 / 1064
» Which Search Problems Are Random
Sort
View
112
Voted
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
15 years 10 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
DCG
2010
137views more  DCG 2010»
15 years 3 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
110
Voted
ICTAI
2009
IEEE
15 years 10 months ago
Enhanced Inference for the Market Split Problem
Inference in constraint programming is usually based on the deductions generated by individual constraints which are then communicated to other constraints through domain filteri...
Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Mei...
96
Voted
JSC
2010
107views more  JSC 2010»
15 years 2 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of e...
Volker Gebhardt, Juan González-Meneses
ATAL
2009
Springer
15 years 10 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...