Sciweavers

2497 search results - page 169 / 500
» Requirements for models of achievable routing
Sort
View
ICTAI
2010
IEEE
14 years 12 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...
WSC
2004
15 years 3 months ago
Visualizing Coercible Simulations
The labor intensive aspects of simulation development and maintenance make exploration of reuse essential. However, reuse is generally difficult to achieve in practice due to infl...
Joseph C. Carnahan, Paul F. Reynolds Jr., David C....
ICSM
2005
IEEE
15 years 7 months ago
Quality Driven Software Migration of Procedural Code to Object-Oriented Design
In the context of software maintenance, legacy software systems are continuously re-engineered in order to correct errors, provide new functionality, or port them into modern plat...
Ying Zou
DAC
2006
ACM
16 years 2 months ago
Optimal simultaneous mapping and clustering for FPGA delay optimization
Both technology mapping and circuit clustering have a large impact on FPGA designs in terms of circuit performance, area, and power dissipation. Existing FPGA design flows carry o...
Joey Y. Lin, Deming Chen, Jason Cong
WWW
2004
ACM
16 years 2 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau