Sciweavers

721 search results - page 79 / 145
» Almost universal graphs
Sort
View
IJSI
2008
91views more  IJSI 2008»
13 years 10 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang
WINE
2007
Springer
124views Economy» more  WINE 2007»
14 years 4 months ago
On the Price of Truthfulness in Path Auctions
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
Qiqi Yan
IV
1999
IEEE
198views Visualization» more  IV 1999»
14 years 2 months ago
A Prototype Hotel Browsing System Using Java3D
Java3D is an application-centred approach to building 3D worlds. We use Java3D and VRML to design a prototype WWW-based 3D Hotel Browsing system. A Java3D scene graph viewer was i...
D. Ball, Majid Mirmehdi
IFIP
1992
Springer
14 years 2 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
14 years 2 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov