Sciweavers

101 search results - page 15 / 21
» Characterizing the Evolution of Class Hierarchies
Sort
View
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 26 days ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
ALT
2001
Springer
14 years 4 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
SIGMETRICS
2004
ACM
14 years 27 days ago
Insensitive load balancing
A large variety of communication systems, including telephone and data networks, can be represented by so-called Whittle networks. The stationary distribution of these networks is...
Thomas Bonald, Matthieu Jonckheere, Alexandre Prou...
IJCAI
2003
13 years 8 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
EOR
2008
119views more  EOR 2008»
13 years 7 months ago
Market sharing dynamics between two service providers
We study the market partition between two distinct firms that deliver services to waiting time sensitive customers. In our model, the incoming customers select a firm on the basis...
Olivier Gallay, Max-Olivier Hongler