Sciweavers

1258 search results - page 134 / 252
» Collection Oriented Match
Sort
View
ENDM
2010
101views more  ENDM 2010»
13 years 9 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 9 months ago
Pants Decomposition of the Punctured Plane
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
Sheung-Hung Poon, Shripad Thite
DCG
2006
89views more  DCG 2006»
13 years 9 months ago
Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions
This paper gives n-dimensional analogues of the Apollonian circle packings in Parts I and II. Those papers considered circle packings described in terms of their Descartes configur...
Ronald L. Graham, Jeffrey C. Lagarias, Colin L. Ma...
JOT
2008
144views more  JOT 2008»
13 years 9 months ago
JAPROSIM: A Java framework for Process Interaction Discrete Event Simulation
In this paper, we discuss various aspects of the design, implementation, and use of JAPROSIM which is a general purpose discrete event simulation framework based on the Java progr...
Bourouis Abdelhabib, Belattar Brahim
AIR
2005
158views more  AIR 2005»
13 years 9 months ago
Review on Computational Trust and Reputation Models
The scientific research in the area of computational mechanisms for trust and reputation in virtual societies is a recent discipline oriented to increase the reliability and perfor...
Jordi Sabater, Carles Sierra