4438 search results - page 757 / 888 » The Case for Collaborative Programming |
145
Voted
FMICS
2008
Springer
15 years 6 months ago
2008
Springer
Given the intractability of exhaustively verifying software, the use of runtime-verification, to verify single execution paths at runtime, is becoming popular. Although the use of ...
123
click to vote
ISSRE
2007
IEEE
15 years 6 months ago
2007
IEEE
Enterprise systems must guarantee high availability and reliability to provide 24/7 services without interruptions and failures. Mechanisms for handling exceptional cases and impl...
141
click to vote
AAAI
2010
15 years 6 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
124
click to vote
APVIS
2008
15 years 6 months ago
2008
We present the Zoomable Adjacency Matrix Explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of nodes and edges. ZAME is based on an adjacency matrix...
140
click to vote
IPCO
2010
15 years 6 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...