Sciweavers

1095 search results - page 42 / 219
» Preprocessing of Intractable Problems
Sort
View
SC
1994
ACM
14 years 2 months ago
Run-time and compile-time support for adaptive irregular problems
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yua...
ESOP
2009
Springer
14 years 1 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
IJCAI
2007
13 years 11 months ago
On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem
This paper investigates how to represent and solve multiagent task scheduling as a Distributed Constraint Optimization Problem (DCOP). Recently multiagent researchers have adopted...
Evan Sultanik, Pragnesh Jay Modi, William C. Regli
FLAIRS
2009
13 years 7 months ago
Automatic Text Categorization of Mathematical Word Problems
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...
Suleyman Cetintas, Luo Si, Yan Ping Xin, Dake Zhan...
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
14 years 4 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann