Sciweavers

738 search results - page 107 / 148
» More generality in efficient multiple kernel learning
Sort
View
CIKM
2007
Springer
14 years 3 months ago
Utilizing a geometry of context for enhanced implicit feedback
Implicit feedback algorithms utilize interaction between searchers and search systems to learn more about users’ needs and interests than expressed in query statements alone. Th...
Massimo Melucci, Ryen W. White
ITS
2004
Springer
99views Multimedia» more  ITS 2004»
14 years 2 months ago
Promoting Effective Help-Seeking Behavior Through Declarative Instruction
The ability to use help-resources efficiently is an important skill in any learning environment, whether the student is in a traditional classroom or is using an Intelligent Tutor...
Ido Roll, Vincent Aleven, Kenneth R. Koedinger
ATAL
2006
Springer
14 years 17 days ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
WICON
2008
13 years 10 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
TPDS
2002
97views more  TPDS 2002»
13 years 8 months ago
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks
Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not e...
Jianping Jiang, Ten-Hwang Lai, Neelam Soundarajan