Sciweavers

1013 search results - page 100 / 203
» A Subexponential Algorithm for Abstract Optimization Problem...
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 8 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
GLOBECOM
2010
IEEE
14 years 11 months ago
Joint Rate Control and Spectrum Allocation under Packet Collision Constraint in Cognitive Radio Networks
Abstract-- We study joint rate control and resource allocation with QoS provisioning that maximizes the total utility of secondary users in cognitive radio networks. We formulate a...
Nguyen H. Tran, Choong Seon Hong
CISS
2008
IEEE
15 years 8 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
192
Voted
INFOCOM
2012
IEEE
13 years 4 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu
WISE
2005
Springer
15 years 7 months ago
A Formal Ontology Reasoning with Individual Optimization: A Realization of the Semantic Web
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
Pakornpong Pothipruk, Guido Governatori