Sciweavers

13376 search results - page 56 / 2676
» Problem Solving with
Sort
View
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
15 years 7 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
ECAI
2000
Springer
15 years 4 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
CP
1998
Springer
15 years 5 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
115
Voted
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 2 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
125
Voted
ADC
2009
Springer
136views Database» more  ADC 2009»
15 years 7 months ago
Solving the Golden Transaction Problem for ARIES-based Multi-level Recovery
Transaction throughput is a crucial issue for database systems. Multi-level transactions have been proposed in an attempt to offer improved concurrency of transaction processing ...
Jayson Speer, Markus Kirchberg, Faizal Riaz-ud-Din...