Sciweavers

4117 search results - page 500 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ANOR
2010
130views more  ANOR 2010»
15 years 7 months ago
Metaheuristic methods based on Tabu search for assigning judges to competitions
Two metaheuristic methods based on Tabu search are introduced to assign judges to individual competitions in a tournament. The complexity of the mathematical formulation accounting...
Amina Lamghari, Jacques A. Ferland
150
Voted
JSAC
2006
108views more  JSAC 2006»
15 years 6 months ago
A simple baseband transmission scheme for power line channels
We propose a simple pulse-amplitude modulation (PAM)-based coded modulation scheme that overcomes two major constraints of power line channels, viz., severe insertion-loss and impu...
Raju Hormis, Inaki Berenguer, Xiaodong Wang
TCBB
2008
73views more  TCBB 2008»
15 years 6 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
186
Voted
TCS
2008
15 years 6 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
NN
1998
Springer
15 years 6 months ago
Serial processing in human movement production
Abstract— This paper presents a study on exploiting the redundancy of a seven-link manipulator to evolve obstacle avoidance skill at the elbow, subjected to endeffector working ...
Joseph A. Doeringer, Neville Hogan