Sciweavers

1559 search results - page 68 / 312
» Some Group Theory Problems
Sort
View
LATA
2009
Springer
15 years 4 months ago
Decision Problems for Convex Languages
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu
KI
2009
Springer
15 years 4 months ago
Planning with h +  in Theory and Practice
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
Christoph Betz, Malte Helmert
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
14 years 11 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
ITS
2000
Springer
137views Multimedia» more  ITS 2000»
15 years 1 months ago
Design Principles for a System to Teach Problem Solving by Modelling
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
Gérard Tisseau, Hélène Giroir...
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
14 years 8 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia