Sciweavers

1006 search results - page 188 / 202
» Clustering of Software Systems Using New Hybrid Algorithms
Sort
View
SIGIR
2006
ACM
14 years 2 months ago
Capturing collection size for distributed non-cooperative retrieval
Modern distributed information retrieval techniques require accurate knowledge of collection size. In non-cooperative environments, where detailed collection statistics are not av...
Milad Shokouhi, Justin Zobel, Falk Scholer, Seyed ...
LCPC
2005
Springer
14 years 2 months ago
Manipulating MAXLIVE for Spill-Free Register Allocation
Abstract. Many embedded systems use single-chip microcontrollers which have no on-chip RAM. In such a system, the processor registers must hold all live data values. Nanocontroller...
Shashi Deepa Arcot, Henry G. Dietz, Sarojini Priya...
SCESM
2006
ACM
262views Algorithms» more  SCESM 2006»
14 years 2 months ago
Scenario-driven modeling and validation of requirements models
Requirements models for large systems typically cannot be developed in a single step, but evolve in a sequence of iterations. We have developed such an iterative modeling process ...
Christian Seybold, Silvio Meier, Martin Glinz
CASES
2006
ACM
14 years 2 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
LCTRTS
2007
Springer
14 years 2 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue