ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 3,978 of 1,394,228
|
|
Results 1 - 20 of 3,978
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
2
|
|
The SCEMP project
|
|
January 1961
|
|
Proceedings of the 1961 16th ACM national meeting
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(155.12 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 1, Downloads (12 Months): 28, Downloads (Overall): 81, Citation Count: 0 |
 |
|
“SCEMP” stands for “Standardized Computational Experiments in Mathematical Programming.” Briefly described, the project is aimed at collecting information and evaluating the efficiencies of a variety of procedures for the computational ...
|
|
3
|
|
4
|
|
5
|
|
6
|
|
On a class of iterative projection and contraction methods for linear programming
|
|
August 1993
|
|
Journal of Optimization Theory and Applications
, Volume 78 Issue 2
|
|
Publisher: Plenum Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
Keywords: Feje´r contraction, linear complementarity problems, linear programming, network programming, projection methods
|
|
7
|
|
Approximation Schemes for Packing with Item Fragmentation
|
|
March 2008
|
|
Theory of Computing Systems
, Volume 43 Issue 1
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
We consider two variants of the classical bin packing problem in which items may be fragmented. This can potentially reduce the total number of bins needed for packing the instance. However, since fragmentation incurs overhead, we attempt to avoid ...
Keywords: Algorithms, Bin packing, Item fragmentation, Linear programming, Polynomial time approximation schemes
|
|
8
|
|
Dependence of multi-dimensional array references
|
|
June 1988
|
|
ICS '88: Proceedings of the 2nd international conference on Supercomputing
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(880.03 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 12, Downloads (12 Months): 23, Downloads (Overall): 187, Citation Count: 10 |
|
|
Accurate data dependence analysis is the key function in vectorizing-restructuring compilers for supercomputers. However, the data dependence analysis algorithms currently available have limitations. Those that execute quickly, such as the Banerjee Test ...
|
|
9
|
|
A Combinational Auction Improves School Meals in Chile
|
|
November 2002
|
|
Interfaces
, Volume 32 Issue 6
|
|
Publisher: INFORMS
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 4 |
|
|
Chile's school system is using mathematical modeling to assign catering contracts in a singleround sealed-bid combinational auction. The Chilean state spends around US$180 million a year to feed 1,300,000 students from low income families, making this ...
Keywords: Games/group decisions: bidding/auctions. government: agencies, Government: agencies
|
|
10
|
|
11
|
|
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
|
|
August 2004
|
|
Computers and Industrial Engineering
, Volume 47 Issue 1
|
|
Publisher: Pergamon Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
A heuristic algorithm for solving the single-hoist, multiple-product scheduling problem is presented. The algorithm uses a non-standard Constraint Satisfaction Problem model and employs variable ordering, forward checking and backtracking. Computational ...
Keywords: backtracking, constraint satisfaction problem, heuristics, hoist scheduling
|
|
12
|
|
13
|
|
14
|
|
15
|
|
Ant Colony Optimization: Introduction and Hybridizations
|
|
September 2007
|
|
HIS '07: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (HIS 2007) - Volume 00
, Volume 00
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
This paper contains complimentary material to the tutorial "ant colony optimization: introduction and hybridizations" given by the author at HIS 2007, Kaiserslautern, Germany. First, ant colony optimization is shortly introduced. Then, successful recent ...
|
|
16
|
|
Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems
|
|
April 1986
|
|
IEEE Transactions on Computers
, Volume 35 Issue 4
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 24 |
|
|
An important consideration in the design of high- performance multiple processor systems should be in ensuring the correctness of results computed by such complex systems which are extremely prone to transient and intermittent failures. The detection ...
Keywords: upper bounds, Checks, errors, fault detection, fault location, graph model, linear programming, lower bounds, system-level faults
|
|
17
|
|
Point inversion and projection for NURBS curve and surface: control polygon approach
|
|
May 2003
|
|
Computer Aided Geometric Design
, Volume 20 Issue 2
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 7 |
|
|
This paper presents an accurate and efficient method to solve both point projection and point inversion for NURBS curves and surfaces. We first subdivide the NURBS curve or surface into a set of Bézier subcurves or patches. Based on the relationship ...
Keywords: NURBS curve, NURBS surface, point inversion, point projection
|
|
18
|
|
Integrated prefetching and caching in single and parallel disk systems
|
|
April 2005
|
|
Information and Computation
, Volume 198 Issue 1
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
We study integrated prefetching and caching in single and parallel disk systems. In the first part of the paper, we investigate approximation algorithms for the single disk problem. There exist two very popular approximation algorithms called Aggressive ...
Keywords: approximation algorithm, caching, linear program, magnetic disks, prefetching
|
|
19
|
|
Optimal pulse observation of one type of systems with delay
|
|
April 2008
|
|
Automation and Remote Control
, Volume 69 Issue 4
|
|
Publisher: Plenum Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Consideration is given to a linear problem of optimal pulse observation of a non-stationary dynamic system with delay in an equation of its mathematical model. To compute estimates of an unknown vector parameter of the initial state of the system, fast ...
Keywords: 02.30.Yy
|
|
20
|
|
Complete controllability
|
|
July 1986
|
|
Journal of Optimization Theory and Applications
, Volume 50 Issue 1
|
|
Publisher: Plenum Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site