Sciweavers

1101 search results - page 39 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
PODC
2012
ACM
13 years 2 days ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
COR
2007
163views more  COR 2007»
14 years 9 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
JAIR
2008
104views more  JAIR 2008»
14 years 9 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
60
Voted
IJCM
2002
68views more  IJCM 2002»
14 years 9 months ago
Computing an Optimal Hatching Direction in Layered Manufacturing
In Layered Manufacturing (LM), a prototype of a virtual polyhedral object is built by slicing the object into polygonal layers, and then building the layers one after another. In ...
Jörg Schwerdt, Michiel H. M. Smid, Man Chung ...
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
14 years 9 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow