Sciweavers

57 search results - page 10 / 12
» Where Do Bugs Come from
Sort
View
FOCS
2003
IEEE
14 years 27 days ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
IJCAI
1997
13 years 9 months ago
Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...
Giuseppe De Giacomo, Yves Lespérance, Hecto...
EJIS
2010
52views more  EJIS 2010»
13 years 7 months ago
Same technology, different outcome? Reinterpreting Barley's Technology as an Occasion for Structuring
In the last few decades, several studies have found the same technology implemented in highly similar organizational settings to be associated with very different consequences for...
Starling David Hunter III
ICPR
2004
IEEE
14 years 8 months ago
Object Class Recognition using Images of Abstract Regions
lass Recognition using Images of Abstract Regions Yi Li, Jeff A. Bilmes, and Linda G. Shapiro Department of Computer Science and Engineering Department of Electrical Engineering Un...
Jeff A. Bilmes, Linda G. Shapiro, Yi Li
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 7 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru