Sciweavers

1995 search results - page 2 / 399
» What's the Problem
Sort
View
ICCS
2005
Springer
14 years 27 days 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&...
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
UML
2005
Springer
14 years 26 days ago
Representing and Applying Design Patterns: What Is the Problem?
Design patterns embody proven solutions to recurring design problems. Ever since the gang of four popularized the concept, researchers have been trying to develop methods for repre...
Hafedh Mili, Ghizlane El-Boussaidi
GECCO
2003
Springer
14 years 18 days ago
What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
Abstract. This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test p...
Jason M. Daida, Hsiaolei Li, Ricky Tang, Adam M. H...
NIPS
2007
13 years 8 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong