Sciweavers

4894 search results - page 834 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
IWPC
2005
IEEE
14 years 1 months ago
Concise and Consistent Naming
Approximately 70% of the source code of a software system consists of identifiers. Hence, the names chosen as identifiers are of paramount importance for the readability of comp...
Florian Deißenböck, Markus Pizka
22
Voted
WECWIS
2005
IEEE
94views ECommerce» more  WECWIS 2005»
14 years 1 months ago
Truthful Online Auctions for Pricing Peer-to-Peer Services
We consider truthful online auctions that aim at optimizing sellers’ revenues, representing service contributors’ satisfactions, as a general model for pricing peer-to-peer se...
Po-An Chen, Tyng-Ruey Chuang
WIOPT
2005
IEEE
14 years 1 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...
KCAP
2005
ACM
14 years 1 months ago
Indirect anaphora resolution as semantic path search
Anaphora occur commonly in natural language text, and resolving them is essential for capturing the knowledge encoded in text. Indirect anaphora are especially challenging to reso...
James Fan, Ken Barker, Bruce W. Porter
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
14 years 1 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek