Sciweavers

1258 search results - page 222 / 252
» Table design in dynamic programming
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 5 months ago
Data Discretization Unification
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
Ruoming Jin, Yuri Breitbart, Chibuike Muoh
131
Voted
CASES
2006
ACM
15 years 5 months ago
Power efficient branch prediction through early identification of branch addresses
Ever increasing performance requirements have elevated deeply pipelined architectures to a standard even in the embedded processor domain, requiring the incorporation of dynamic b...
Chengmo Yang, Alex Orailoglu
119
Voted
EDO
2006
Springer
15 years 5 months ago
Damon: a decentralized aspect middleware built on top of a peer-to-peer overlay network
In this paper we present Damon, a decentralized wide-area runtime aspect middleware built on top of a structured peer-topeer (p2p) substrate and a dynamic Aspect Oriented Programm...
Rubén Mondéjar, Pedro García ...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 3 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ICSE
2010
IEEE-ACM
15 years 3 months ago
Requirements reflection: requirements as runtime entities
Computational reflection is a well-established technique that gives a program the ability to dynamically observe and possibly modify its behaviour. To date, however, reflection is...
Nelly Bencomo, Jon Whittle, Peter Sawyer, Anthony ...