Sciweavers

7167 search results - page 1323 / 1434
» Answer Set Programming
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
HICSS
2005
IEEE
125views Biometrics» more  HICSS 2005»
14 years 2 months ago
Taking Topic Detection From Evaluation to Practice
Abstract— The Topic Detection and Tracking (TDT) research community investigates information retrieval methods for organizing a constantly arriving stream of news articles by the...
James Allan, Stephen M. Harding, David Fisher, Alv...
INFOCOM
2005
IEEE
14 years 2 months ago
Optimal ISP subscription for Internet multihoming: algorithm design and implication analysis
— Multihoming is a popular method used by large enterprises and stub ISPs to connect to the Internet to reduce cost and improve performance. Recently researchers have studied the...
Hao Wang, Haiyong Xie 0002, Lili Qiu, Abraham Silb...
MEMOCODE
2005
IEEE
14 years 2 months ago
Extended abstract: a race-free hardware modeling language
We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We de...
Patrick Schaumont, Sandeep K. Shukla, Ingrid Verba...
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
« Prev « First page 1323 / 1434 Last » Next »