Sciweavers

1026 search results - page 25 / 206
» On Finding Minimal w-cutset
Sort
View
ICCAD
1999
IEEE
93views Hardware» more  ICCAD 1999»
14 years 1 months ago
LEOPARD: a Logical Effort-based fanout OPtimizer for ARea and Delay
We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing a...
Peyman Rezvani, Amir H. Ajami, Massoud Pedram, Ham...
DAM
1999
90views more  DAM 1999»
13 years 8 months ago
Note on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
Fedor V. Fomin
SOCO
2002
Springer
13 years 8 months ago
Fuzzy relation equations (I): the general and specialized solving algorithms
In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathema...
Li Chen, Paul P. Wang
COMPGEOM
2005
ACM
13 years 11 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
NIPS
1994
13 years 10 months ago
Finding Structure in Reinforcement Learning
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...
Sebastian Thrun, Anton Schwartz