Sciweavers

1559 search results - page 273 / 312
» Fundamentals of Generic Programming
Sort
View
AUTOMATICA
2004
125views more  AUTOMATICA 2004»
14 years 9 months ago
Hamiltonian discretization of boundary control systems
A fundamental problem in the simulation and control of complex physical systems containing distributed-parameter components concerns finite-dimensional approximation. Numerical me...
Goran Golo, Viswanath Talasila, Arjan van der Scha...
CCR
2004
151views more  CCR 2004»
14 years 9 months ago
Practical verification techniques for wide-area routing
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
Nick Feamster
TCS
1998
14 years 9 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
TEC
2002
119views more  TEC 2002»
14 years 9 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...
TPDS
2002
126views more  TPDS 2002»
14 years 9 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma