Sciweavers

1029 search results - page 69 / 206
» An Architecture for Problem Solving with Diagrams
Sort
View
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
14 years 1 months ago
Satisfiability-Based Detailed FPGA Routing
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar
UML
1998
Springer
14 years 1 months ago
Literate Modelling - Capturing Business Knowledge with the UML
At British Airways, we have found during several large OO projects documented using the UML that non-technical end-users, managers and business domain experts find it difficult to ...
Jim Arlow, Wolfgang Emmerich, John Quinn
AAAI
2010
13 years 10 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 9 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
ATAL
2010
Springer
13 years 4 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...