Sciweavers

613 search results - page 90 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
ICDCS
1989
IEEE
15 years 6 months ago
Transparent Concurrent Execution of Mutually Exclusive Alternatives
We examine the task of concurrently computing alternative solutions to a problem. We restrict our interest to the case where only one of the solutions is needed; in this case we n...
Jonathan M. Smith, Gerald Q. Maguire Jr.
109
Voted
EOR
2006
128views more  EOR 2006»
15 years 2 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...
128
Voted
JUCS
2007
84views more  JUCS 2007»
15 years 2 months ago
Optimized Compilation of Around Advice for Aspect Oriented Programs
: The technology that supports Aspect-Oriented Programming (AOP) tools is inherently intrusive, since it changes the behavior of base application code. Advice weaving performed by ...
Eduardo S. Cordeiro, Roberto da Silva Bigonha, Mar...
DAC
2005
ACM
16 years 3 months ago
Multi-threaded reachability
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
123
Voted
AINA
2006
IEEE
15 years 8 months ago
Efficient Packet Matching for Gigabit Network Intrusion Detection using TCAMs
Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to...
Ming Gao, Kenong Zhang, Jiahua Lu