8780 search results - page 174 / 1756 » On the Feasibility of Consistent Computations |
152
Voted
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we descri...
222
Voted
CSDA
2004
15 years 7 months ago
2004
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
198
click to vote
PODS
2004
ACM
16 years 7 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
183
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
Difficulties understanding update paths while understanding code cause developers to waste time and insert bugs. A detailed investigation of these difficulties suggests that a wid...
202
click to vote
QSHINE
2005
IEEE
16 years 21 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...