Sciweavers

4355 search results - page 84 / 871
» Increasing Kolmogorov Complexity
Sort
View
EUROSYS
2011
ACM
13 years 8 days ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
14 years 9 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
CCIA
2007
Springer
14 years 3 months ago
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
Martí Sánchez, Simon de Givry, Thoma...
MICRO
2003
IEEE
108views Hardware» more  MICRO 2003»
14 years 2 months ago
Reducing Design Complexity of the Load/Store Queue
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
Il Park, Chong-liang Ooi, T. N. Vijaykumar
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm