Sciweavers

2223 search results - page 207 / 445
» Ontological Framework for Approximation
Sort
View
ISPD
2006
ACM
102views Hardware» more  ISPD 2006»
15 years 12 months ago
A faster implementation of APlace
APlace is a high quality, scalable analytical placer. This paper describes our recent efforts to improve APlace for speed and scalability. We explore various wirelength and densi...
Andrew B. Kahng, Qinke Wang
CIE
2005
Springer
15 years 8 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
JAIR
2006
122views more  JAIR 2006»
15 years 6 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 5 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
TSP
2008
129views more  TSP 2008»
15 years 4 months ago
A Basic Convergence Result for Particle Filtering
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...
Xiao-Li Hu, Thomas B. Schön, Lennart Ljung