Sciweavers

1711 search results - page 308 / 343
» Completing pseudojump operators
Sort
View
SODA
1993
ACM
118views Algorithms» more  SODA 1993»
13 years 9 months ago
Scapegoat Trees
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
Igal Galperin, Ronald L. Rivest
COLING
1990
13 years 9 months ago
Corpus Work With PC Beta
ct. PC Beta is a PC oriented tool for corpus work in this term's broadest possible sense. With PC Beta one can prepare texts for corpus work, e.g. standardize texts in differe...
Benny Brodda
ATAL
2010
Springer
13 years 9 months ago
Exploiting domain knowledge to improve norm synthesis
Social norms enable coordination in multiagent systems by constraining agent behaviour in order to achieve a social objective. Automating the design of social norms has been shown...
George Christelis, Michael Rovatsos, Ronald P. A. ...
EUROPAR
2010
Springer
13 years 9 months ago
Toward Real-Time, Many-Task Applications on Large Distributed Systems
In the age of Grid, Cloud, volunteer computing, massively parallel applications are deployed over tens or hundreds of thousands of resources over short periods of times to complete...
Sangho Yi, Derrick Kondo, David P. Anderson
HPDC
2010
IEEE
13 years 9 months ago
Efficient querying of distributed provenance stores
Current projects that automate the collection of provenance information use a centralized architecture for managing the resulting metadata - that is, provenance is gathered at rem...
Ashish Gehani, Minyoung Kim, Tanu Malik