Sciweavers

2654 search results - page 467 / 531
» On Pairing Inversion Problems
Sort
View
FOCS
2006
IEEE
15 years 6 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
15 years 6 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
111
Voted
SPAA
2005
ACM
15 years 6 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
15 years 6 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
96
Voted
OR
2005
Springer
15 years 6 months ago
Optimal Fares for Public Transport
The fare planning problem for public transport is to design a system of fares that maximize the revenue. We introduce a nonlinear optimization model to approach this problem. It i...
Ralf Borndörfer, Marika Neumann, Marc E. Pfet...