Scheduling jobs before shut-down
Nordic Journal of Computing
Scheduling Jobs Before Shut-Down
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Removable Online Knapsack Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Node-Level Energy Management for Sensor Networks in the Presence of Multiple Applications
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Node-level energy management for sensor networks in the presence of multiple applications
Wireless Networks - Special issue: Pervasive computing and communications
Approximate and online multi-issue negotiation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Budget constrained bidding in keyword auctions and online knapsack problems
Proceedings of the 17th international conference on World Wide Web
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Optimal Resource Augmentations for Online Knapsack
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
Large-Scale Scientific Computing
Selling ad campaigns: online algorithms with cancellations
Proceedings of the 10th ACM conference on Electronic commerce
Online Knapsack Problems with Limited Cuts
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the sum minimization version of the online bin covering problem
Discrete Applied Mathematics
Breaking out of the box of recommendations: from items to packages
Proceedings of the fourth ACM conference on Recommender systems
Online knapsack with resource augmentation
Information Processing Letters
Online removable knapsack with limited cuts
Theoretical Computer Science
Selective call out and real time bidding
WINE'10 Proceedings of the 6th international conference on Internet and network economics
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Ant colony optimization for multiple knapsack problem and model bias
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
Online minimization knapsack problem
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
On the advice complexity of the knapsack problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Planning in logistics: a survey
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
Theoretical Computer Science
An entropy-based neighbor selection approach for collaborative filtering
Knowledge-Based Systems
| Hi-index | 0.00 |