Sciweavers

18306 search results - page 147 / 3662
» Algorithmics in Exponential Time
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Taming user-generated content in mobile networks via Drop Zones
Abstract—Smartphones have changed the way people communicate. Most prominently, using commonplace mobile device features (e.g., high resolution cameras), they started producing a...
Ionut Trestian, Supranamaya Ranjan, Aleksandar Kuz...
JAIR
2008
171views more  JAIR 2008»
14 years 10 months ago
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
DAM
2010
66views more  DAM 2010»
14 years 10 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
AAAI
2012
13 years 12 days ago
Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
Blai Bonet, Hector Geffner
FLOPS
2004
Springer
15 years 3 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger