Sciweavers

2523 search results - page 282 / 505
» Objective: In Minimum Context
Sort
View
DAC
1997
ACM
15 years 10 months ago
Analysis and Evaluation of Address Arithmetic Capabilities in Custom DSP Architectures
—Many application-specific architectures provide indirect addressing modes with auto-increment/decrement arithmetic. Since these architectures generally do not feature an indexe...
Ashok Sudarsanam, Stan Y. Liao, Srinivas Devadas
ICTAI
1993
IEEE
15 years 10 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
IGIS
1994
145views GIS» more  IGIS 1994»
15 years 10 months ago
Approximations for a Multi-Step Processing of Spatial Joins
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
Thomas Brinkhoff, Hans-Peter Kriegel
WCNC
2010
IEEE
15 years 10 months ago
Optimal Tradeoff Between Transmission Rate and Packet Duration in Wireless Ad Hoc Networks
—This paper considers the tradeoff between bursty and continuous transmissions in wireless ad hoc networks. In our network model, packets belonging to specific transmitters arri...
Jon E. Corneliussen, Mariam Kaynia, Geir E. &Oslas...
COCOON
2006
Springer
15 years 10 months ago
Improved On-Line Broadcast Scheduling with Deadlines
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, F...