Sciweavers

465 search results - page 27 / 93
» On the Hardness of Range Assignment Problems
Sort
View
COR
2011
14 years 6 months ago
Event-based MILP models for resource-constrained project scheduling problems
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
Oumar Koné, Christian Artigues, Pierre Lope...
RTCSA
2005
IEEE
15 years 5 months ago
Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems
We present an approach to the analysis and optimization of heterogeneous distributed embedded systems for hard real-time applications. The systems are heterogeneous not only in te...
Traian Pop, Paul Pop, Petru Eles, Zebo Peng
IAT
2009
IEEE
15 years 3 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
CIKM
2009
Springer
15 years 3 months ago
Improving binary classification on text problems using differential word features
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
Justin Martineau, Tim Finin, Anupam Joshi, Shamit ...
TCS
2008
14 years 11 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...