Sciweavers

721 search results - page 61 / 145
» On Generators of Random Quasigroup Problems
Sort
View
CEC
2007
IEEE
14 years 2 months ago
Towards an immune system that solves CSP
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
María-Cristina Riff, Marcos Zú&ntild...
ICCBR
2003
Springer
14 years 1 months ago
Soft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Nicoleta Neagu, Boi Faltings
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 8 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
TOG
2010
134views more  TOG 2010»
13 years 2 months ago
Unbiased, adaptive stochastic sampling for rendering inhomogeneous participating media
Realistic rendering of participating media is one of the major subjects in computer graphics. Monte Carlo techniques are widely used for realistic rendering because they provide u...
Yonghao Yue, Kei Iwasaki, Bing-Yu Chen, Yoshinori ...
ECP
1999
Springer
157views Robotics» more  ECP 1999»
14 years 10 days ago
SAT-Based Procedures for Temporal Reasoning
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...
Alessandro Armando, Claudio Castellini, Enrico Giu...