Sciweavers

4451 search results - page 332 / 891
» On Random Ordering Constraints
Sort
View
ANSS
2004
IEEE
15 years 10 months ago
A Spatial Analysis of Mobility Models: Application to Wireless Ad Hoc Network Simulation
We quantatively analyze the differences between a realistic mobility model, TRANSIMS, and several synthetic mobility models. New synthetic models were created by modifying the sta...
D. Charles Engelhart, Anand Sivasubramaniam, Chris...
DAGSTUHL
2007
15 years 8 months ago
Anonymity-Proof Voting Rules
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
Vincent Conitzer
AVI
2006
15 years 8 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
SGP
2003
15 years 8 months ago
Statistical Point Geometry
We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes ...
Aravind Kalaiah, Amitabh Varshney
ALGORITHMICA
2006
90views more  ALGORITHMICA 2006»
15 years 6 months ago
Destruction of Very Simple Trees
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); th...
James Allen Fill, Nevin Kapur, Alois Panholzer