Sciweavers

4488 search results - page 232 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
ATAL
2006
Springer
15 years 8 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
AIED
2007
Springer
15 years 10 months ago
Can Help Seeking Be Tutored? Searching for the Secret Sauce of Metacognitive Tutoring
In our on-going endeavor to teach students better help-seeking skills we designed a three-pronged Help-Seeking Support Environment that includes (a) classroom instruction (b) a Sel...
Ido Roll, Vincent Aleven, Bruce M. McLaren, Kennet...
ICRA
2005
IEEE
116views Robotics» more  ICRA 2005»
15 years 9 months ago
Using Hierarchical EM to Extract Planes from 3D Range Scans
— Recently, the acquisition of three-dimensional maps has become more and more popular. This is motivated by the fact that robots act in the three-dimensional world and several t...
Rudolph Triebel, Wolfram Burgard, Frank Dellaert
FOCS
2008
IEEE
15 years 10 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder