Sciweavers

2412 search results - page 110 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
JC
2008
128views more  JC 2008»
15 years 3 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
298
Voted
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 3 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
140
Voted
ANOR
2004
208views more  ANOR 2004»
15 years 3 months ago
Airline Crew Rostering: Problem Types, Modeling, and Optimization
Airline crew rostering is an important part of airline operations and an interesting problem for the application of operations research. The objective is to assign anonymous crew p...
Niklas Kohl, Stefan E. Karisch
118
Voted
ESOP
2005
Springer
15 years 8 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
ATAL
2009
Springer
15 years 9 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein