Sciweavers

5316 search results - page 231 / 1064
» Which Search Problems Are Random
Sort
View
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 4 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
CONSTRAINTS
2011
14 years 11 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
135
Voted
SARA
2007
Springer
15 years 10 months ago
A Meta-CSP Model for Optimal Planning
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
Peter Gregory, Derek Long, Maria Fox
ENTCS
2007
190views more  ENTCS 2007»
15 years 4 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 10 months ago
Memory-based immigrants for genetic algorithms in dynamic environments
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
Shengxiang Yang