Sciweavers

2446 search results - page 223 / 490
» Choiceless Polynomial Time
Sort
View
JSA
2010
95views more  JSA 2010»
13 years 3 months ago
Multi-level reconfigurable architectures in the switch model
In this paper we study multi-level dynamically reconfigurable architectures. These are extensions of standard reconfigurable architectures where ordinary reconfiguration operation...
Sebastian Lange, Martin Middendorf
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
12 years 11 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann
CONCUR
2011
Springer
12 years 8 months ago
Tractable Reasoning in a Fragment of Separation Logic
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
Byron Cook, Christoph Haase, Joël Ouaknine, M...
ICC
2011
IEEE
217views Communications» more  ICC 2011»
12 years 7 months ago
A Distributed Algorithm for Multi-Constrained Anypath Routing in Wireless Mesh Networks
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
Xi Fang, Dejun Yang, Guoliang Xue
AAMAS
2012
Springer
12 years 4 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...