Sciweavers

14518 search results - page 221 / 2904
» Two Problems for Sophistication
Sort
View
ISMIS
2009
Springer
15 years 7 months ago
GIS-FLSolution: A Spatial Analysis Platform for Static and Transportation Facility Location Allocation Problem
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...
Wei Gu, Xin Wang, Liqiang Geng
MFCS
2009
Springer
15 years 7 months ago
On Pebble Automata for Data Languages with Decidable Emptiness Problem
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-peb...
Tony Tan
123
Voted
CEC
2008
IEEE
15 years 7 months ago
Solving deceptive problems using a genetic algorithm with reserve selection
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
130
Voted
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 7 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
80
Voted
ICCS
2005
Springer
15 years 6 months ago
What Makes the Arc-Preserving Subsequence Problem Hard?
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, St&...