Sciweavers

16596 search results - page 309 / 3320
» Generalized Assignment Problems
Sort
View
AAMAS
2008
Springer
15 years 7 months ago
Agents that argue and explain classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent/incomplete/uncertain knowledge, based on the construction and the comparison of ar...
Leila Amgoud, Mathieu Serrurier
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 7 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 6 months ago
Resource Allocation for Downlink Cellular OFDMA Systems: Part I - Optimal Allocation
In this pair of papers (Part I and Part II in this issue), we investigate the issue of power control and subcarrier assignment in a sectorized two-cell downlink OFDMA system impair...
Nassar Ksairi, Pascal Bianchi, Philippe Ciblat, Wa...
JCSS
2007
63views more  JCSS 2007»
15 years 6 months ago
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
Rodolfo Pellizzoni, Giuseppe Lipari
184
Voted
AI
2002
Springer
15 years 6 months ago
Learning cost-sensitive active classifiers
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
Russell Greiner, Adam J. Grove, Dan Roth