Sciweavers

4894 search results - page 554 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
DCOSS
2006
Springer
15 years 8 months ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
EUROCRYPT
2006
Springer
15 years 8 months ago
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Abstract. Lattice-based signature schemes following the GoldreichGoldwasser-Halevi (GGH) design have the unusual property that each signature leaks information on the signer's...
Phong Q. Nguyen, Oded Regev
141
Voted
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 8 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
ACID
2006
239views Algorithms» more  ACID 2006»
15 years 6 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
NIPS
2004
15 years 6 months ago
Learning first-order Markov models for control
First-order Markov models have been successfully applied to many problems, for example in modeling sequential data using Markov chains, and modeling control problems using the Mar...
Pieter Abbeel, Andrew Y. Ng