Sciweavers

836 search results - page 73 / 168
» On the Complexity of Train Assignment Problems
Sort
View
INFOCOM
2003
IEEE
15 years 9 months ago
Prophet Address Allocation for Large Scale MANETs
—A mobile device in a MANET must be assigned a free IP address before it may participate in unicast communication. This is a fundamental and difficult problem in the practical us...
Hongbo Zhou, Lionel M. Ni, Matt W. Mutka
DAC
1997
ACM
15 years 8 months ago
System-Level Synthesis of Low-Power Hard Real-Time Systems
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
Darko Kirovski, Miodrag Potkonjak
IAT
2009
IEEE
15 years 7 months ago
Confusion and Distance Metrics as Performance Criteria for Hierarchical Classification Spaces
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
Wilbert van Norden, Catholijn M. Jonker
AAAI
2012
13 years 6 months ago
Optimal Proportional Cake Cutting with Connected Pieces
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
132
Voted
IJCNN
2007
IEEE
15 years 10 months ago
Preference Learning for Category-Ranking based Interactive Text Categorization
— Category Ranking is a variant of the multi-label classification problem, in which, rather than performing a (hard) assignment to an object of categories from a predefined set...
Fabio Aiolli, Fabrizio Sebastiani, Alessandro Sper...