Sciweavers

914 search results - page 50 / 183
» Branch and Bound on the Network Model
Sort
View
WG
1998
Springer
15 years 1 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
83
Voted
DAC
1997
ACM
15 years 1 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
83
Voted
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
14 years 10 months ago
Developing neural structure of two agents that play checkers using cartesian genetic programming
A developmental model of neural network is presented and evaluated in the game of Checkers. The network is developed using cartesian genetic programs (CGP) as genotypes. Two agent...
Gul Muhammad Khan, Julian Francis Miller, David M....
65
Voted
ICRA
2005
IEEE
102views Robotics» more  ICRA 2005»
15 years 3 months ago
Planning 3-D Path Networks in Unstructured Environments
Abstract— In this paper, we explore the problem of threedimensional motion planning in highly cluttered and unstructured outdoor environments. Because accurate sensing and modeli...
Nicolas Vandapel, James Kuffner, Omead Amidi