Sciweavers

1132 search results - page 112 / 227
» Structural Average Case Complexity
Sort
View
IJCAI
2001
13 years 10 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
NIPS
2003
13 years 10 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 9 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen
IJFCS
2002
122views more  IJFCS 2002»
13 years 8 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
SERA
2010
Springer
13 years 7 months ago
A UML Based Deployment and Management Modeling for Cooperative and Distributed Applications
Thanks to the major evolutions in the communication technologies and in order to deal with a continuous increase in systems complexity, current applications have to cooperate to ac...
Mohammed Nadhmi Miladi, Fatma Krichen, Mohamed Jma...