Sciweavers

2239 search results - page 299 / 448
» Computing with abstract matrix structures
Sort
View
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 2 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
75
Voted
PPDP
2000
Springer
15 years 1 months ago
Enhanced sharing analysis techniques: a comprehensive evaluation
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
TROB
2010
96views more  TROB 2010»
14 years 8 months ago
Stochastic Modular Robotic Systems: A Study of Fluidic Assembly Strategies
Abstract—Modular robotic systems typically assemble using deterministic processes where modules are directly placed into their target position. By contrast, stochastic modular ro...
Michael Thomas Tolley, Michael Kalontarov, Jonas N...
99
Voted
ICSE
2011
IEEE-ACM
14 years 1 months ago
Leveraging software architectures to guide and verify the development of sense/compute/control applications
A software architecture describes the structure of a computing system by specifying software components and their interactions. Mapping a software architecture to an implementatio...
Damien Cassou, Emilie Balland, Charles Consel, Jul...
103
Voted
AC
1998
Springer
14 years 10 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn