Sciweavers

2100 search results - page 228 / 420
» Fundamentals of the problem
Sort
View
EGC
2005
Springer
14 years 4 months ago
A Monitoring Architecture for Control Grids
Abstract. Monitoring systems are nowadays ubiquitous in complex environments, such as Grids. Their use is fundamental for performance evaluation, problem spotting, advanced debuggi...
Alexandru Iosup, Nicolae Tapus, Stéphane Vi...
PPDP
2005
Springer
14 years 4 months ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 3 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
NLUCS
2004
14 years 4 days ago
A Text Mining Approach to Tracking Elements of Decision Making: a pilot study
Understanding rework, the causes of rework, and the relationship between issues, decisions and the associated actions, is crucial in minimizing the fundamental industrial problems ...
Caroline Chibelushi, Bernadette Sharp, Andy Salter
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 11 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng