Sciweavers

1818 search results - page 140 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
JDA
2011
104views more  JDA 2011»
13 years 5 months ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
EVOW
2011
Springer
13 years 1 months ago
Towards Procedural Strategy Game Generation: Evolving Complementary Unit Types
The Strategy Game Description Game Language (SGDL) is intended to become a complete description of all aspects of strategy games, including rules, parameters, scenarios, maps, and ...
Tobias Mahlmann, Julian Togelius, Georgios N. Yann...
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
12 years 10 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
RTA
2005
Springer
14 years 3 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
CEC
2009
IEEE
14 years 5 months ago
Rigorous time complexity analysis of Univariate Marginal Distribution Algorithm with margins
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao