Sciweavers

524 search results - page 85 / 105
» Context Trees
Sort
View
SAC
2005
ACM
15 years 3 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
68
Voted
BIRTHDAY
2005
Springer
15 years 3 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
SSD
2005
Springer
105views Database» more  SSD 2005»
15 years 3 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
68
Voted
DIAGRAMS
2004
Springer
15 years 2 months ago
Reasoning with Projected Contours
Projected contours enable Euler diagrams to scale better. They enable the representation of information using less syntax and can therefore increase visual clarity. Here informal r...
Chris John
76
Voted
ICRA
2003
IEEE
111views Robotics» more  ICRA 2003»
15 years 2 months ago
Fuzzy Petri nets for monitoring and recovery
- In this paper, we propose a unitary tool for modeling and analysis of discrete event systems monitoring. Uncertain knowledge of such tasks asks specific reasoning and adapted fuz...
Daniel I. Racoceanu, Eugenia Minca, Noureddine Zer...