Sciweavers

1920 search results - page 285 / 384
» The Complexity of the A B C Problem
Sort
View
JAIR
2007
95views more  JAIR 2007»
13 years 8 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
COMCOM
1998
106views more  COMCOM 1998»
13 years 8 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
IVS
2002
106views more  IVS 2002»
13 years 8 months ago
Pixel bar charts: a visualization technique for very large multi-attribute data sets?
Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data presenting only a very small number of data values (as in the case of bar charts) ...
Daniel A. Keim, Ming C. Hao, Umeshwar Dayal, Meich...
MST
1998
76views more  MST 1998»
13 years 8 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
CSIE
2009
IEEE
13 years 6 months ago
The Pilot Way to Grid Resources Using glideinWMS
Grid computing has become very popular in big and widespread scientific communities with high computing demands, like high energy physics. Computing resources are being distribute...
Igor Sfiligoi, Daniel C. Bradley, Burt Holzman, Pa...