Sciweavers

9842 search results - page 355 / 1969
» Problem complexity
Sort
View
TWC
2010
15 years 1 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
ECBS
2000
IEEE
125views Hardware» more  ECBS 2000»
15 years 11 months ago
Design Tool Integration: An Exercise in Semantic Interoperability
The integration of software tools used in an engineering process is a problem that arises frequently in large-scale engineering projects. Traditional approaches are insufficient f...
Gabor Karsai
179
Voted
CASC
2006
Springer
106views Mathematics» more  CASC 2006»
15 years 10 months ago
Simplicial Perturbation Techniques and Effective Homology
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
Rocío González-Díaz, Bel&eacu...
VLDB
1997
ACM
140views Database» more  VLDB 1997»
15 years 11 months ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis
CACM
2006
95views more  CACM 2006»
15 years 7 months ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing