Sciweavers

2780 search results - page 64 / 556
» Generalizing by Removing Detail
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
OOPSLA
2009
Springer
15 years 11 months ago
Dependable, online upgrades in enterprise systems
Software upgrades are unreliable, often causing downtime or data loss. I propose Imago, an approach for removing the leading causes of upgrade failures (broken dependencies) and o...
Tudor Dumitras
ESWS
2007
Springer
15 years 10 months ago
Measuring Inconsistencies in Ontologies
Abstract. In this paper, we propose a novel approach to measure inconsistencies in ontologies based on Shapley values, which are originally proposed for game theory. This measure c...
Xi Deng, Volker Haarslev, Nematollaah Shiri
HT
2004
ACM
15 years 10 months ago
Lust, touch, metadata: meaning and the limits of adaptation
Adding and removing links carries great rhetorical weight. Modern hypertext tools often treat links as metadata and use metadata to provide navigational access. To view links or m...
Mark Bernstein
EURODAC
1994
IEEE
113views VHDL» more  EURODAC 1994»
15 years 8 months ago
Formal verification of pipeline conflicts in RISC processors
We outline a general methodology for the formal verification of pipeline conflicts in RISC cores. The different kinds of conflicts that can occur due to the simultaneous execution...
Ramayya Kumar, Sofiène Tahar