Sciweavers

2233 search results - page 264 / 447
» On the Complexity of Theory Curbing
Sort
View
COMPGEOM
2003
ACM
15 years 11 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
ATAL
2003
Springer
15 years 11 months ago
Transition-independent decentralized markov decision processes
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
EICS
2010
ACM
15 years 11 months ago
Self-explanatory user interfaces by model-driven engineering
Modern User Interfaces (UI) must deal with the increasing complexity of applications as well as new features such as the capacity of UIs to be dynamically adapted to the context o...
Alfonso García Frey
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 11 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
LICS
2000
IEEE
15 years 11 months ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel