Sciweavers

3433 search results - page 351 / 687
» Heuristics for a bidding problem
Sort
View
TIME
2002
IEEE
15 years 11 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
ICN
2001
Springer
15 years 11 months ago
Backbone Network Design with QoS Requirements
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
Hong-Hsu Yen, Frank Yeong-Sung Lin
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 11 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
FPGA
2006
ACM
125views FPGA» more  FPGA 2006»
15 years 10 months ago
Armada: timing-driven pipeline-aware routing for FPGAs
While previous research has shown that FPGAs can efficiently implement many types of computations, their flexibility inherently limits their clock rate. Several research groups ha...
Kenneth Eguro, Scott Hauck
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 10 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace