Sciweavers

2632 search results - page 88 / 527
» Alternating Timed Automata
Sort
View
IJCAI
2003
15 years 2 months ago
Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
David Page, Soumya Ray
SIGMOD
2010
ACM
120views Database» more  SIGMOD 2010»
14 years 8 months ago
Paper bricks: an alternative to complete-story peer reviewing
The peer review system as used in several computer science communities has several flaws including long review times, overloaded reviewers, as well as fostering of niche topics. T...
Jens Dittrich
OSDI
1994
ACM
15 years 2 months ago
Storage Alternatives for Mobile Computers
Mobile computers such as notebooks, subnotebooks, and palmtops require low weight, low power consumption, and good interactive performance. These requirements impose many challeng...
Fred Douglis, Ramón Cáceres, M. Fran...
CC
2007
Springer
129views System Software» more  CC 2007»
15 years 7 months ago
Extended Linear Scan: An Alternate Foundation for Global Register Allocation
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
Vivek Sarkar, Rajkishore Barik
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 5 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh