Sciweavers

666 search results - page 48 / 134
» Domain Name Solution Causes New Problems
Sort
View
ASPDAC
2006
ACM
98views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Timing-driven placement based on monotone cell ordering constraints
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
Chanseok Hwang, Massoud Pedram
ECML
2007
Springer
14 years 25 days ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 8 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
OWLED
2008
13 years 10 months ago
Opening, Closing Worlds - On Integrity Constraints
In many data-centric applications it is desirable to use OWL as an expressive schema language where one expresses constraints that need to be satisfied by the (instance) data. Howe...
Evren Sirin, Michael Smith, Evan Wallace
ATAL
2009
Springer
14 years 3 months ago
A distributed constraint optimization approach for coordination under uncertainty
Distributed Constraint Optimization (DCOP) provides a rich framework for modeling multi-agent coordination problems. Existing problem domains for DCOP focus on small (<100 vari...
James Atlas