Sciweavers

4137 search results - page 299 / 828
» On the number of matchings of a tree
Sort
View
EDUTAINMENT
2006
Springer
15 years 10 months ago
Dynamic User Modeling for Sketch-Based User Interface
Abstract. This paper presents a strategy of dynamic user modeling for sketchbased user interface. A user model is defined as an incremental decision tree for a specific user. A dra...
Zhengxing Sun, Bin Li, Qiang Wang, Guihuan Feng
MPC
2000
Springer
105views Mathematics» more  MPC 2000»
15 years 10 months ago
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Sergei M. Abramov, Robert Glück
CORR
2007
Springer
78views Education» more  CORR 2007»
15 years 6 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber
IPPS
2007
IEEE
16 years 1 months ago
Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
1 Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as Grids and PlanetLab. This paper proposes a scalable Grid monitoring architect...
Min Cai, Kai Hwang
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
16 years 5 days ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow