Sciweavers

335 search results - page 50 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
DAC
2004
ACM
14 years 25 days ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
COMPGEOM
2010
ACM
14 years 15 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
FOCS
2003
IEEE
14 years 21 days ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
IUI
2009
ACM
14 years 4 months ago
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
Melinda T. Gervasio, Janet L. Murdock
FUZZIEEE
2007
IEEE
14 years 1 months ago
A Fuzzy Action Selection Method for Virtual Agent Navigation in Unknown Virtual Environments
This paper presents an action selection method using fuzzy logic. The objective is to solve behaviour conflict in behaviour-based architectures for virtual agent navigation in un...
Jafreezal Jaafar, Eric McKenzie, Alan Smaill