Sciweavers

455 search results - page 74 / 91
» Approximation Algorithms for Partial Covering Problems
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 4 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
IJCAI
1997
14 years 11 months ago
Model Minimization, Regression, and Propositional STRIPS Planning
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
Robert Givan, Thomas Dean
HICSS
2003
IEEE
122views Biometrics» more  HICSS 2003»
15 years 3 months ago
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
Wei Lou, Jie Wu
ICDCS
2006
IEEE
15 years 3 months ago
Self-Protection for Wireless Sensor Networks
Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves...
Dan Wang, Qian Zhang, Jiangchuan Liu
85
Voted
MOBIHOC
2009
ACM
15 years 10 months ago
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
Dong-Hoon Shin, Saurabh Bagchi