Sciweavers

1225 search results - page 95 / 245
» Maximal Consistent Subsets
Sort
View
IROS
2007
IEEE
110views Robotics» more  IROS 2007»
14 years 3 months ago
Multi-agent search with interim positive information
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
Haye Lau, Shoudong Huang, Gamini Dissanayake
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 3 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
ATAL
2007
Springer
14 years 3 months ago
Locating RF emitters with large UAV teams
This chapter describes a principled, yet computationally efficient way for a team of UAVs with Received Signal Strength Indicator (RSSI) sensors to locate radio frequency emitting...
Paul Scerri, Robin Glinton, Sean Owens, Steven Oka...
WINE
2007
Springer
182views Economy» more  WINE 2007»
14 years 3 months ago
Mechanism Design on Trust Networks
We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed ...
Arpita Ghosh, Mohammad Mahdian, Daniel M. Reeves, ...
FOCS
2006
IEEE
14 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau