Sciweavers

1271 search results - page 230 / 255
» On Simulation-Checking with Sequential Systems
Sort
View
SIAMJO
2010
83views more  SIAMJO 2010»
13 years 6 months ago
The Lifted Newton Method and Its Application in Optimization
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
Jan Albersmeyer, Moritz Diehl
CC
2009
Springer
149views System Software» more  CC 2009»
14 years 8 months ago
Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction
Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelisi...
Lin Gao 0002, Lian Li 0002, Jingling Xue, Tin-Fook...
SIGCSE
2009
ACM
139views Education» more  SIGCSE 2009»
14 years 8 months ago
Abstraction and extensibility in digital logic simulation software
ion and Extensibility in Digital Logic Simulation Software Richard M. Salter and John L. Donaldson Computer Science Department Oberlin College Oberlin, OH 44074 rms@cs.oberlin.edu,...
Richard M. Salter, John L. Donaldson
VLDB
2002
ACM
141views Database» more  VLDB 2002»
14 years 8 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 7 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor