Sciweavers

14161 search results - page 234 / 2833
» On generalized middle-level problem
Sort
View
MFCS
2007
Springer
16 years 20 days ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
PKC
2007
Springer
100views Cryptology» more  PKC 2007»
16 years 19 days ago
Multi-bit Cryptosystems Based on Lattice Problems
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
COMPGEOM
2003
ACM
15 years 11 months ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
IPPS
1999
IEEE
15 years 10 months ago
A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...
Dalessandro Soares Vianna, Luiz Satoru Ochi, L&uac...
ECAI
2000
Springer
15 years 10 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon