Sciweavers

663 search results - page 53 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
LCN
2005
IEEE
14 years 1 months ago
GaMa : An Evolutionary Algorithmic Approach for the Design of Mesh-Based Radio Access Networks
Wireless mesh based access networks are destined to play a pivotal role in next generation broadband systems. With the proliferation of mesh networks, a key issue for network desi...
Samik Ghosh, Preetam Ghosh, Kalyan Basu, Sajal K. ...
CSI
2006
136views more  CSI 2006»
13 years 7 months ago
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
TCS
2008
13 years 7 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
JMLR
2002
106views more  JMLR 2002»
13 years 7 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
VLSID
2002
IEEE
120views VLSI» more  VLSID 2002»
14 years 8 months ago
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...
Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoi...