Sciweavers

1322 search results - page 135 / 265
» Parameterized counting problems
Sort
View
AIMSA
2008
Springer
14 years 3 days ago
A Hybrid Approach to Distributed Constraint Satisfaction
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...
IJCAI
2007
13 years 11 months ago
Inferring Long-term User Properties Based on Users' Location History
Recent development of location technologies enables us to obtain the location history of users. This paper proposes a new method to infer users’ longterm properties from their r...
Yutaka Matsuo, Naoaki Okazaki, Kiyoshi Izumi, Yosh...
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 10 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
FOCM
2007
48views more  FOCM 2007»
13 years 10 months ago
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
Alexander I. Barvinok
PROCEDIA
2010
86views more  PROCEDIA 2010»
13 years 8 months ago
Scaling of ab-initio nuclear physics calculations on multicore computer architectures
We discuss the scaling behavior of a state-of-the-art Configuration Interaction code for nuclear physics on modern multicore computer architectures. In the CI approach, the quant...
Pieter Maris, Masha Sosonkina, James P. Vary, Esmo...