Sciweavers

126 search results - page 20 / 26
» Surrogate constraint normalization for the set covering prob...
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
14 years 4 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...
JELIA
2004
Springer
14 years 23 days ago
Hierarchical Decision Making by Autonomous Agents
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
EACL
1993
ACL Anthology
13 years 8 months ago
Delimitedness And Trajectory-Of-Motion Events
The first part of the paper develops a novel, sortally-based approach to the problem of aspectual composition. The account is argued to be superior on both empirical and computati...
Michael White
ICCV
1999
IEEE
13 years 11 months ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...