1356 search results - page 51 / 272 » Some New Results on Inverse Sorting Problems |
LATIN
2010
Springer
14 years 28 days ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
EVOW
2005
Springer
14 years 2 months ago
2005
Springer
Applying evolutionary methods to the generation of music and art is a relatively new field of enquiry. While there have been some important developments, it might be argued that to...
JGAA
2007
13 years 9 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
ANOR
2011
13 years 27 days ago
2011
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
DASFAA
2007
IEEE
14 years 3 months ago
2007
IEEE
In the era of the Internet, more and more privacy-sensitive data is published online. Even though this kind of data are published with sensitive attributes such as name and social ...