Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An Optimal Cache for a Federated Database System
Journal of Intelligent Information Systems
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Automated Meta-Control for Adaptable Real-Time Software
Real-Time Systems
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
Journal of the ACM (JACM)
P-Complete Approximation Problems
Journal of the ACM (JACM)
A Direct Descent Binary Knapsack Algorithm
Journal of the ACM (JACM)
Approximation Algorithms for Some Postman Problems
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
An analysis of inline substitution for a structured programming language
Communications of the ACM
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Data Mining and Knowledge Discovery
Perceptually-driven decision theory for interactive realistic rendering
ACM Transactions on Graphics (TOG)
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
An algorithm for selection of migration candidates
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
A post-compiler approach to scratchpad mapping of code
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
MSA: a memory-aware utility accrual scheduling algorithm
Proceedings of the 2005 ACM symposium on Applied computing
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
An adaptive algorithm for selecting profitable keywords for search-based advertising services
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Maximum utilization of vehicle capacity: A case of MRO items
Computers and Industrial Engineering
A genetic algorithm for solving the first price sealed bid auction in communication networks
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Efficient signature based malware detection on mobile devices
Mobile Information Systems
Investigations of continual computation
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Controlling the losing probability in a monotone game
Information Sciences: an International Journal
Playing monotone games to understand learning behaviors
Theoretical Computer Science
Bandwidth allocation in cellular networks with multiple interferences
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Near optimal objects packing through dimensional unfolding
IAAI'96 Proceedings of the eighth annual conference on Innovative applications of artificial intelligence
Reoptimizing the 0-1 knapsack problem
Discrete Applied Mathematics
An incremental approach to scheduling during overloads in real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Space efficiency in group recommendation
The VLDB Journal — The International Journal on Very Large Data Bases
Perception, attention, and resources: a decision-theoretic approach to graphics rendering
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Journal of Discrete Algorithms
Heuristic approaches to service level agreements in packet networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Vector bin packing with multiple-choice
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Vector bin packing with multiple-choice
Discrete Applied Mathematics
Data communication channel capacity for multiple-buffered concentrators
Computer Communications
Approximation algorithms for the capacitated plant allocation problem
Operations Research Letters
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
Operations Research Letters
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem
Applied Soft Computing
| Hi-index | 0.02 |