Sciweavers

5055 search results - page 243 / 1011
» Relative Timing
Sort
View
CN
2011
88views more  CN 2011»
15 years 1 months ago
Multi-hour network planning based on domination between sets of traffic matrices
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
Pablo Pavón-Mariño, Belen Garcia-Man...
292
Voted
CIDR
2011
337views Algorithms» more  CIDR 2011»
14 years 10 months ago
The Schema-Independent Database UI: A Proposed Holy Grail and Some Suggestions
If you have ever encountered a piece of highly domain-specific business software, you may have noticed that it was largely a graphical front-end to some relational database. You ...
Eirik Bakke, Edward Benson
CODES
2008
IEEE
15 years 8 months ago
A time-predictable system initialization design for huge-capacity flash-memory storage systems
The capacity of flash-memory storage systems grows at a speed similar to many other storage systems. In order to properly manage the product cost, vendors face serious challenges ...
Chin-Hsien Wu
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
15 years 12 months ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac
DAC
2006
ACM
16 years 7 months ago
An efficient and versatile scheduling algorithm based on SDC formulation
Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most ...
Jason Cong, Zhiru Zhang