Sciweavers

8647 search results - page 569 / 1730
» The Container Selection Problem
Sort
View
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
16 years 1 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
176
Voted
ICTAI
2003
IEEE
16 years 10 days ago
S-MEP: A Planner for Numeric Goals
Planning for numeric goals is an important problem. Only one of the many participants from the 2002 international planning competition (Metric-FF) can effectively handle problems ...
Javier Sanchez, Amol Dattatraya Mali
JCDL
2003
ACM
80views Education» more  JCDL 2003»
16 years 10 days ago
Repository Synchronization in the OAI Framework
The Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH) began as an alternative to distributed searching of scholarly eprint repositories. The model embraced by th...
Xiaoming Liu 0005, Kurt Maly, Mohammad Zubair, Mic...
FCT
2001
Springer
15 years 11 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
15 years 11 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo