699 search results - page 97 / 140 » The method of combinatorial telescoping |
95
Voted
AAAI
2010
15 years 2 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
98
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
104
Voted
AIPS
2006
15 years 1 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
142
Voted
STRINGOLOGY
2004
15 years 1 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
73
Voted
WSC
2001
15 years 1 months ago
2001
Multitrajectory Simulation allows random events in a simulation to generate multiple trajectories. Management techniques have been developed to manage the choices of trajectories ...