Sciweavers

1805 search results - page 287 / 361
» Functional programming with structured graphs
Sort
View
ISSTA
2006
ACM
14 years 3 months ago
Architecture-based testing using goals and plans
This paper presents a specification-based testing approach that compares software specifications defined at different f abstraction, e.g. architecture and implementation, agai...
Kristina Winbladh, Thomas A. Alspaugh, Hadar Ziv, ...
CN
2006
70views more  CN 2006»
13 years 9 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman
CC
2002
Springer
145views System Software» more  CC 2002»
13 years 9 months ago
Forwarding in Attribute Grammars for Modular Language Design
Abstract. Forwarding is a technique for providing default attribute definitions in attribute grammars that is helpful in the modular implementation of programming languages. It com...
Eric Van Wyk, Oege de Moor, Kevin Backhouse, Paul ...
APPML
2007
154views more  APPML 2007»
13 years 9 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio
ICALP
2010
Springer
14 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket