Sciweavers

46 search results - page 9 / 10
» A characterization of c.e. random reals
Sort
View
EAAI
2007
154views more  EAAI 2007»
13 years 7 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 2 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
LCN
2006
IEEE
14 years 1 months ago
Clustered Mobility Model for Scale-Free Wireless Networks
ā€” Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free power-law connectivity distribution and a few densely...
Sunho Lim, Chansu Yu, Chita R. Das
JSSPP
2005
Springer
14 years 1 months ago
An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering
Recently HP Labs engaged in a joint project with DreamWorks Animation to develop a Utility Rendering Service that was used to render part of the computer-animated feature ļ¬lm Shr...
Yunhong Zhou, Terence Kelly, Janet L. Wiener, Eric...
CCR
2008
84views more  CCR 2008»
13 years 7 months ago
Modeling internet topology dynamics
Despite the large number of papers on network topology modeling and inference, there still exists ambiguity about the real nature of the Internet AS and router level topology. Whi...
Hamed Haddadi, Steve Uhlig, Andrew W. Moore, Richa...