Sciweavers

12289 search results - page 518 / 2458
» computing 2006
Sort
View
MST
2010
83views more  MST 2010»
15 years 5 months ago
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
IPPS
2006
IEEE
16 years 29 days ago
An evaluation of heuristics for SLA based parallel job scheduling
In the context of SLA based job scheduling for high performance grid computing, this paper investigates the behaviour of various scheduling heuristics to schedule SLA-bounded jobs...
Viktor Yarmolenko, Rizos Sakellariou
IJON
1998
91views more  IJON 1998»
15 years 6 months ago
WEBSOM - Self-organizing maps of document collections
With the WEBSOM method a textual document collection may be organized onto a graphical map display that provides an overview of the collection and facilitates interactive browsing...
Samuel Kaski, Timo Honkela, Krista Lagus, Teuvo Ko...
CF
2006
ACM
16 years 27 days ago
A dependability perspective on emerging technologies
t available: Pdf (734.64 KB) Additional Information: full citation, abstract, references, index terms Bibliometrics: Downloads (6 Weeks): 25, Downloads (12 Months): 230, Citation C...
Lucian Prodan, Mihai Udrescu, Mircea Vladutiu
JGAA
2006
75views more  JGAA 2006»
15 years 6 months ago
Upward Planar Drawings and Switch-regularity Heuristics
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
Walter Didimo