Sciweavers

5100 search results - page 633 / 1020
» The Linear Complexity of a Graph
Sort
View
WINE
2009
Springer
147views Economy» more  WINE 2009»
15 years 11 months ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 11 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
PODC
2010
ACM
15 years 10 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
DSD
2009
IEEE
160views Hardware» more  DSD 2009»
15 years 10 months ago
Conservative Dynamic Energy Management for Real-Time Dataflow Applications Mapped on Multiple Processors
Voltage-frequency scaling (VFS) trades a linear processor slowdown for a potentially quadratic reduction in energy consumption. Complex dependencies may exist between different tas...
Anca Mariana Molnos, Kees Goossens
ICCAD
1995
IEEE
127views Hardware» more  ICCAD 1995»
15 years 10 months ago
Hybrid decision diagrams
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao