Sciweavers

6111 search results - page 38 / 1223
» Time, Hardware, and Uniformity
Sort
View
ICALP
2010
Springer
14 years 14 days ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
13 years 12 months ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
DATE
2009
IEEE
111views Hardware» more  DATE 2009»
14 years 2 months ago
Increased accuracy through noise injection in abstract RTOS simulation
RTOS Simulation Henning Zabel, Wolfgang Mueller Universität Paderborn, C-LAB Fürstenallee 11, D-33102 Paderborn, Germany —Today, mobile and embedded real-time systems have to c...
Henning Zabel, Wolfgang Mueller
ICCD
2002
IEEE
109views Hardware» more  ICCD 2002»
14 years 4 months ago
Physical Planning Of On-Chip Interconnect Architectures
Interconnect architecture plays an important role in determining the throughput of meshed communication structures. We assume a mesh structure with uniform communication demand fo...
Hongyu Chen, Bo Yao, Feng Zhou, Chung-Kuan Cheng
ISMVL
2000
IEEE
90views Hardware» more  ISMVL 2000»
14 years 2 days ago
Structures with Many-Valued Information and Their Relational Proof Theory
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
Ivo Düntsch, Wendy MacCaull, Ewa Orlowska