Sciweavers

4112 search results - page 63 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
175
Voted
ICCV
2009
IEEE
15 years 1 months ago
Efficient multi-label ranking for multi-class learning: Application to object recognition
Multi-label learning is useful in visual object recognition when several objects are present in an image. Conventional approaches implement multi-label learning as a set of binary...
Serhat Selcuk Bucak, Pavan Kumar Mallapragada, Ron...
CCE
2004
15 years 3 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
CORR
2010
Springer
85views Education» more  CORR 2010»
15 years 4 months ago
A control-theoretical methodology for the scheduling problem
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
Carlo A. Furia, Alberto Leva, Martina Maggio, Paol...
133
Voted
JSAC
2010
116views more  JSAC 2010»
14 years 10 months ago
Utility-based asynchronous flow control algorithm for wireless sensor networks
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...
Jiming Chen, WeiQiang Xu, Shibo He, Youxian Sun, P...
154
Voted
FLAIRS
2004
15 years 5 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar