Sciweavers

427 search results - page 18 / 86
» A Graph Based Synthesis Algorithm for Solving CSPs
Sort
View
SAC
2004
ACM
14 years 1 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
AI
2000
Springer
13 years 7 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
GLVLSI
2007
IEEE
187views VLSI» more  GLVLSI 2007»
14 years 2 months ago
DAG based library-free technology mapping
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
Felipe S. Marques, Leomar S. da Rosa Jr., Renato P...
VLSID
2002
IEEE
128views VLSI» more  VLSID 2002»
14 years 8 months ago
System-Level Point-to-Point Communication Synthesis using Floorplanning Information
: In this paper, we present a point-to-point (P2P) communication synthesis methodology for SystemOn-Chip (SOC) design. We consider real-time systems where IP selection, mapping and...
Jingcao Hu, Yangdong Deng, Radu Marculescu
ICCCN
2007
IEEE
14 years 2 months ago
A Novel Signal Reconstruction Algorithm for Perception Based Data Reduction in Haptic Signal Communication
The performance and immersiveness of telepresence and teleaction systems critically depend on the quality of the communication between the operator and the teleoperator. High pack...
Julius Kammerl, Peter Hinterseer, Eckehard G. Stei...