Sciweavers

4047 search results - page 625 / 810
» The Discrete Basis Problem
Sort
View
FOCS
2002
IEEE
15 years 9 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
ESAW
2000
Springer
15 years 7 months ago
Engineering Social Order
Social Order becomes a major problem in MAS and in computer mediated human interaction. After explaining the notions of Social Order and Social Control, I claim that there are mult...
Cristiano Castelfranchi
AIPS
2003
15 years 5 months ago
A Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
BMCBI
2008
130views more  BMCBI 2008»
15 years 4 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...
IVC
2008
147views more  IVC 2008»
15 years 4 months ago
Distinctive and compact features
We consider the problem of extracting features for multi-class recognition problems. The features are required to make fine distinction between similar classes, combined with tole...
Ayelet Akselrod-Ballin, Shimon Ullman