Sciweavers

583 search results - page 65 / 117
» Finding Answers to Complex Questions
Sort
View
PODC
2009
ACM
16 years 3 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
135
Voted
TON
2010
221views more  TON 2010»
14 years 9 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
124
Voted
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 4 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 6 months ago
Predicting completion times of batch query workloads using interaction-aware models and simulation
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...
Mumtaz Ahmad, Songyun Duan, Ashraf Aboulnaga, Shiv...
129
Voted
MASCOTS
2003
15 years 4 months ago
Considering the Energy Consumption of Mobile Storage Alternatives
This paper is motivated by a simple question: what are the energy consumption characteristics of mobile storage alternatives? To answer this question, we are faced with a design s...
Fengzhou Zheng, Nitin Garg, Sumeet Sobti, Chi Zhan...