Sciweavers

2180 search results - page 140 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
15 years 6 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
130
Voted
HICSS
2005
IEEE
134views Biometrics» more  HICSS 2005»
15 years 8 months ago
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
ICML
2005
IEEE
16 years 4 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 7 months ago
A Communication Scheduling Algorithm for Multi-FPGA Systems
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
Jinwoo Suh, Dong-In Kang, Stephen P. Crago
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
15 years 8 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava