Sciweavers

461 search results - page 63 / 93
» Splitting NP-Complete Sets
Sort
View
ICRA
2009
IEEE
144views Robotics» more  ICRA 2009»
15 years 11 months ago
Reusable electronics and adaptable communication as implemented in the odin modular robot
Abstract— This paper describes the electronics and communication system of Odin, a novel heterogeneous modular robot made of links and joints. The electronics is divided into two...
Ricardo Franco Mendoza Garcia, Andreas Lyder, Davi...
IPPS
2009
IEEE
15 years 11 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
TPHOL
2009
IEEE
15 years 11 months ago
Practical Tactics for Separation Logic
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
Andrew McCreight
MATES
2009
Springer
15 years 10 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos
CEC
2008
IEEE
15 years 10 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...