Sciweavers

837 search results - page 75 / 168
» Hard combinators
Sort
View
HYBRID
2000
Springer
15 years 3 months ago
Towards Procedures for Systematically Deriving Hybrid Models of Complex Systems
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
Pieter J. Mosterman, Gautam Biswas
CHARME
1995
Springer
120views Hardware» more  CHARME 1995»
15 years 3 months ago
Timing analysis of asynchronous circuits using timed automata
In this paper we present a method formodeling asynchronous digital circuits by timed automata. The constructed timed automata serve as \mechanical" and veri able objects for a...
Oded Maler, Amir Pnueli
GD
1995
Springer
15 years 3 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
RTAS
1995
IEEE
15 years 3 months ago
ControlShell: component-based real-time programming
Real-time system software is notoriously hard to share and reuse. This paper walks through the methodology and application of ControlShell, a component-based programming system re...
Stanley A. Schneider, Vincent W. Chen, Gerardo Par...
WSC
2008
15 years 2 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese