Sciweavers

9405 search results - page 1165 / 1881
» Computing a Model of Set Theory
Sort
View
CORR
2011
Springer
152views Education» more  CORR 2011»
15 years 2 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
WWW
2011
ACM
15 years 2 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
CANDC
2011
ACM
14 years 7 months ago
Understanding exploratory creativity in a visual domain
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
Kyle E. Jennings, Dean Keith Simonton, Stephen E. ...
ICAS
2009
IEEE
125views Robotics» more  ICAS 2009»
16 years 2 months ago
Tools for Architecture Based Autonomic Systems
Recent years have seen a growing interest in autonomic computing, an approach to providing systems with self managing properties [1]. Autonomic computing aims to address the incre...
Noel De Palma, Konstantin Popov, Nikos Parlavantza...
IPPS
2006
IEEE
16 years 1 months ago
High-level execution and communication support for parallel grid applications in JGrid
This paper describes the high-level execution and communication support provided in JGrid, a serviceoriented dynamic grid framework. One of its core services, the Compute Service,...
Szabolcs Pota, Zoltan Juhasz
« Prev « First page 1165 / 1881 Last » Next »