Sciweavers

3218 search results - page 221 / 644
» Timed Extensions for SDL
Sort
View
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 10 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
SIGIR
2010
ACM
15 years 10 months ago
Temporal diversity in recommender systems
Collaborative Filtering (CF) algorithms, used to build webbased recommender systems, are often evaluated in terms of how accurately they predict user ratings. However, current eva...
Neal Lathia, Stephen Hailes, Licia Capra, Xavier A...
174
Voted
AICCSA
2001
IEEE
103views Hardware» more  AICCSA 2001»
15 years 10 months ago
Toward a Comprehensive Framework for Software Process Modeling Evolution
Software process modeling has undergone extensive changes in the last three decades, impacting process' structure, degree of control, degree of visualization, degree of autom...
Osama Eljabiri, Fadi P. Deek
JCO
2006
126views more  JCO 2006»
15 years 6 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li
MANSCI
2008
128views more  MANSCI 2008»
15 years 6 months ago
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
Júlíus Atlason, Marina A. Epelman, S...