Sciweavers

6829 search results - page 139 / 1366
» Quantitative Generalizations of Languages
Sort
View
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 4 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
PUC
2006
93views more  PUC 2006»
15 years 4 months ago
Comparing end-user and intelligent remote control interface generation
Traditional remote controls typically allow users to activate functionality of a single device. Given that users activate a subset of functionality across devices to accomplish a p...
Olufisayo Omojokun, Jeffrey S. Pierce, Charles Lee...
TSMC
1998
97views more  TSMC 1998»
15 years 4 months ago
Parallel algorithms for modules of learning automata
— Parallel algorithms are presented for modules of learning automata with the objective of improving their speed of convergence without compromising accuracy. A general procedure...
M. A. L. Thathachar, M. T. Arvind
137
Voted
JEA
2010
95views more  JEA 2010»
15 years 3 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...
DLT
2009
15 years 2 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin