Sciweavers

1184 search results - page 191 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
ICS
2005
Tsinghua U.
15 years 7 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
135
Voted
DSN
2005
IEEE
15 years 7 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 6 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
177
Voted
ECRTS
2010
IEEE
15 years 3 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
76
Voted
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
15 years 7 months ago
Learning the Ideal Evaluation Function
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
Edwin D. de Jong, Jordan B. Pollack