Sciweavers

1983 search results - page 186 / 397
» Competitive graph searches
Sort
View
FPL
2001
Springer
107views Hardware» more  FPL 2001»
14 years 18 days ago
Gambit: A Tool for the Simultaneous Placement and Detailed Routing of Gate-Arrays
In this paper we present a new method of integrating the placement and routing stages in the physical design of channel-based architectures, and present the first implementation o...
John Karro, James P. Cohoon
ECAI
2000
Springer
14 years 13 days ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
14 years 11 days ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
AHS
2006
IEEE
188views Hardware» more  AHS 2006»
13 years 12 months ago
Finite State Machine IP Watermarking: A Tutorial
Sharing Intellectual Property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach...
Amr T. Abdel-Hamid, Sofiène Tahar, El Mosta...
ECML
2006
Springer
13 years 11 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang