Sciweavers

803 search results - page 108 / 161
» Aggregation operators and decision modeling
Sort
View
SOFSEM
2010
Springer
14 years 5 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 10 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
CAISE
2010
Springer
13 years 9 months ago
Beyond Process Mining: From the Past to Present and Future
Abstract. Traditionally, process mining has been used to extract models from event logs and to check or extend existing models. This has shown to be useful for improving processes ...
Wil M. P. van der Aalst, Maja Pesic, Minseok Song
CPAIOR
2005
Springer
14 years 2 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
COMPSAC
2006
IEEE
14 years 2 months ago
Performance Analysis of an Asynchronous Web Server
Modern Web servers need to process multiple requests concurrently in order to fulfill the workload demands expected of them. Concurrency can be implemented in a Web server using ...
U. Praphamontripong, Swapna S. Gokhale, Aniruddha ...