Sciweavers

1856 search results - page 365 / 372
» Formal Dialectic Specification
Sort
View
FAC
2006
122views more  FAC 2006»
13 years 6 months ago
The verified software repository: a step towards the verifying compiler
The Verified Software Repository is dedicated to a long-term vision of a future in which all computer systems justify the trust that Society increasingly places in them. This will ...
Juan Bicarregui, C. A. R. Hoare, J. C. P. Woodcock
FGCS
2006
114views more  FGCS 2006»
13 years 6 months ago
A semantic approach to discovering learning services in grid-based collaborative systems
CSCL systems can benefit from using grids since they offer a common infrastructure enabling the access to an extended pool of resources that can provide supercomputing capabilitie...
Guillermo Vega-Gorgojo, Miguel L. Bote-Lorenzo, Ed...
JCB
2006
185views more  JCB 2006»
13 years 6 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
JSAC
2006
157views more  JSAC 2006»
13 years 6 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
KI
2006
Springer
13 years 6 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler