Sciweavers

14774 search results - page 2748 / 2955
» Computational complexity and evolutionary computation
Sort
View
CSR
2010
Springer
15 years 12 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
233
Voted
EDCC
2010
Springer
15 years 12 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
337
Voted
MHCI
2009
Springer
15 years 11 months ago
pieTouch: a direct touch gesture interface for interacting with in-vehicle information systems
Touch-sensitive displays seem like a natural and promising option for dealing with the increasing complexity of current in-vehicle information systems (IVIS), but since they can h...
Ronald Ecker, Verena Broy, Andreas Butz, Alexander...
CONCUR
2001
Springer
15 years 11 months ago
Extended Temporal Logic Revisited
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
193
Voted
CP
2001
Springer
15 years 11 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
« Prev « First page 2748 / 2955 Last » Next »