Sciweavers

2239 search results - page 300 / 448
» Computing with abstract matrix structures
Sort
View
ICCS
2007
Springer
15 years 2 months ago
Building Verifiable Sensing Applications Through Temporal Logic Specification
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
Asad Awan, Ahmed H. Sameh, Suresh Jagannathan, Ana...
86
Voted
ASM
2004
ASM
15 years 3 months ago
Intra-step Interaction
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
Yuri Gurevich
82
Voted
ICS
2010
Tsinghua U.
15 years 3 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
92
Voted
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 1 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
IJCAI
1989
14 years 11 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran