Sciweavers

16666 search results - page 2485 / 3334
» Descriptive and Computational Complexity
Sort
View
SAC
2006
ACM
16 years 1 months ago
Event-driven scheduling for dynamic workload scaling in uniprocessor embedded systems
Many embedded systems are designed to take timely reactions to the occurrences of interested scenarios. Sometimes transient overloads might be experienced due to hardware malfunct...
Li-Pin Chang
SAC
2006
ACM
16 years 1 months ago
J2EE server scalability through EJB replication
With the development of Internet-based business, Web applications are becoming increasingly complex. The J2EE specification aims at enabling the design of such web application ser...
Sylvain Sicard, Noel De Palma, Daniel Hagimont
SIGCOMM
2006
ACM
16 years 1 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 1 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
SLIP
2006
ACM
16 years 1 months ago
Energy/area/delay trade-offs in the physical design of on-chip segmented bus architecture
— The increasing gap between design productivity and chip complexity and the emerging Systems-On-Chip (SOC) architectural template have led to the wide utilization of reusable ha...
Jin Guo, Antonis Papanikolaou, Pol Marchal, Franck...
« Prev « First page 2485 / 3334 Last » Next »