ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 22,133 of 1,394,228
|
|
Results 1 - 20 of 22,133
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
A path-relinking approach for a bi-criteria disassembly sequencing problem
|
|
December 2008
|
|
Computers and Operations Research
, Volume 35 Issue 12
|
|
Publisher: Elsevier Science Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
The first crucial step of product recovery is disassembly. Some product disassembly is almost always needed in remanufacturing, recycling, and disposal. Since disassembly tends to be expensive, disassembly sequence planning becomes important in minimizing ...
Keywords: Disassembly sequence problem, GRASP, Multicriteria, Path relinking, Reverse logistics
|
|
2
|
|
3
|
|
4
|
|
Scheduling Real-Time Systems with End-to-End Timing Constraints Using the Distributed Pinwheel Model
|
|
January 2001
|
|
IEEE Transactions on Computers
, Volume 50 Issue 1
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
Abstract¿Real-time distributed applications have timing constraints on tasks running on several processors. To design real-time systems with end-to-end performance requirements, we need to have algorithms to schedule and to coordinate tasks on different ...
Keywords: Distributed system, real-time system, pinwheel scheduling, end-to-end delay.
|
|
5
|
|
Distribution-independent hierarchical N-body methods
|
|
November 1995
|
|
Distribution-independent hierarchical N-body methods
|
|
Publisher: Iowa State University
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
|
Keywords: Greengard method
|
|
6
|
|
A Bayesian weighting principle for the fundamental matrix estimation
|
|
November 2000
|
|
Pattern Recognition Letters
, Volume 21 Issue 12
|
|
Publisher: Elsevier Science Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
Keywords: correspondence problem, epipolar geometry, fundamental matrix, outlier rejection, stereo vision
|
|
7
|
|
Strong bias of group generators: an obstacle to the "product replacement algorithm"
|
|
February 2004
|
|
Journal of Algorithms
, Volume 50 Issue 2
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Let G be a finite group. Efficient generation of nearly uniformly distributed random elements in G, starting from a given set of generators of G, is a central problem in computational group theory. In this paper we demonstrate ...
|
|
8
|
|
9
|
|
On Blind Timing Acquisition and Channel Estimation for Wideband Multiuser DS-CDMA Systems
|
|
February 2002
|
|
Journal of VLSI Signal Processing Systems
, Volume 30 Issue 1/3
|
|
Publisher: Kluwer Academic Publishers
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
The problems of blind timing acquisition and channel estimation for DS-CDMA signals in multipath fading channels are investigated. Using only the spreading code of the desired user, methods based on QR decompositions are proposed. These methods ...
Keywords: DS-CDMA, QR decompositions, blind algorithms, channel estimation, multipath fading, multiuser systems, synchronization, timing acquisition, wideband CDMA
|
|
10
|
|
11
|
|
Recursive Computation of Trispectrum
|
|
October 2006
|
|
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
, Volume E89-A Issue 10
|
|
Publisher: Oxford University Press
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, ...
Keywords: power spectral density (PSD), periodogram, bispectrum, trispectrum, sliding DFT
|
|
12
|
|
On-Line Algorithms for the Dynamic Traveling Repair Problem
|
|
May 2004
|
|
Journal of Scheduling
, Volume 7 Issue 3
|
|
Publisher: Kluwer Academic Publishers
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 5 |
|
|
We consider the dynamic traveling repair problem in which requests with deadlines arrive through time on points in a metric space. Servers move from point to point at constant speed. The goal is to plan the motion of servers so that the maximum number ...
|
|
13
|
|
An analytic modelling approach for network routing algorithms that use "ant-like" mobile agents
|
|
October 2005
|
|
Computer Networks: The International Journal of Computer and Telecommunications Networking
, Volume 49 Issue 2
|
|
Publisher: Elsevier North-Holland, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
In this paper, we introduce an analytic modelling approach to the study of a novel class of adaptive network routing algorithm, which is inspired by the emergent problem-solving behaviours observed in biological ant colonies. This class of algorithm ...
Keywords: adaptive routing, ant-based routing, reinforcement learning, wardrop equilibria
|
|
14
|
|
Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching
|
|
March 2007
|
|
Algorithmica
, Volume 47 Issue 3
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
We consider the problem of scheduling jobs arriving over time in a multiprocessor setting, with immediate dispatching, disallowing job migration. The goal is to minimize both the total flow time (total time in the system) and the total completion time. ...
|
|
15
|
|
Notes: On the exact constant in the L2 Markov inequality
|
|
April 2008
|
|
Journal of Approximation Theory
, Volume 151 Issue 2
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
In this note we consider the classical extremal problem of estimating the L"2-norm of the derivative of an algebraic polynomial when its norm is given. For the supremum norm the corresponding extremal problem was solved by A.A. Markov, but finding the ...
Keywords: 41A17, L2-norm, Legendre polynomials, Markov inequality
|
|
16
|
|
On simultaneous congruence and norms of Hermitian Matrices
|
|
January 1991
|
|
SIAM Journal on Matrix Analysis and Applications
, Volume 12 Issue 1
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
17
|
|
18
|
|
19
|
|
On the complexity of coordinated display of multimedia objects
|
|
July 2000
|
|
Theoretical Computer Science
, Volume 242 Issue 1-2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
Keywords: complexity, multimedia, non-textual data types, resource scheduling, storage management
|
|
20
|
|
Minimizing Average Flow-time: Upper and Lower Bounds
|
|
October 2007
|
|
FOCS '07: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of scheduling on unrelated machines and we show that no online algorithm can ...
|
|
|
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
Request Permissions
Pdf