Sciweavers

26354 search results - page 297 / 5271
» How we refactor, and how we know it
Sort
View
CLA
2007
15 years 8 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
AAAI
2000
15 years 8 months ago
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
Raul Trejo, Vladik Kreinovich, Chitta Baral
BMCBI
2007
109views more  BMCBI 2007»
15 years 6 months ago
A domain-based approach to predict protein-protein interactions
Background: Knowing which proteins exist in a certain organism or cell type and how these proteins interact with each other are necessary for the understanding of biological proce...
Mudita Singhal, Haluk Resat
DC
2010
15 years 6 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride
IMC
2010
ACM
15 years 4 months ago
Revisiting the case for a minimalist approach for network flow monitoring
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
Vyas Sekar, Michael K. Reiter, Hui Zhang