Sciweavers

699 search results - page 24 / 140
» The method of combinatorial telescoping
Sort
View
DAM
2008
101views more  DAM 2008»
13 years 8 months ago
Three Hoppy path problems and ternary paths
In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indice...
Eva Yu-Ping Deng, Toufik Mansour
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 2 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 8 months ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
MICCAI
2007
Springer
14 years 9 months ago
Combinatorial Optimization for Electrode Labeling of EEG Caps
Abstract. An important issue in electroencephalographiy (EEG) experiments is to measure accurately the three dimensional (3D) positions of the electrodes. We propose a system where...
Jean-Michel Badier, Mickaël Péchaud, R...
CP
2009
Springer
14 years 9 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...