Sciweavers

5314 search results - page 931 / 1063
» Hybrid Dynamic Programming
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 1 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
AINA
2004
IEEE
15 years 1 months ago
Wide-Area Real-Time Distributed Computing in a Tightly Managed Optical Grid - An Optiputer Vision
: Wide area network (WAN) -based distributed computing (DC) has become an active field of research, especially under the label of grid computing. On the other hand, research on WAN...
K. H. (Kane) Kim
DAC
2004
ACM
15 years 1 months ago
An SoC design methodology using FPGAs and embedded microprocessors
In System on Chip (SoC) design, growing design complexity has esigners to start designs at higher abstraction levels. This paper proposes an SoC design methodology that makes full...
Nobuyuki Ohba, Kohji Takano
CASES
2006
ACM
15 years 1 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
CP
2006
Springer
15 years 1 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider