Sciweavers

254 search results - page 12 / 51
» On the randomized solution of initial value problems
Sort
View
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
13 years 11 months ago
Multi-objective test problems, linkages, and evolutionary methodologies
Existing test problems for multi-objective optimization are criticized for not having adequate linkages among variables. In most problems, the Pareto-optimal solutions correspond ...
Kalyanmoy Deb, Ankur Sinha, Saku Kukkonen
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 7 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
FOCS
1999
IEEE
13 years 12 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
COR
2007
112views more  COR 2007»
13 years 7 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
ISCC
2003
IEEE
14 years 25 days ago
Fair Noiseless Broadcast Source Coding
We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector Ò ½...
Serdar Boztas