2266 search results - page 10 / 454 » Some Solutions to the Ignoring Problem |
80
Voted
DAM
2008
14 years 9 months ago
2008
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
BMCBI
2006
14 years 9 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
87
Voted
CN
2010
14 years 9 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
77
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
87
Voted
CEC
2007
IEEE
2007
IEEE
Flexibility of design variables to pareto-optimal solutions in multi objective optimization problems
14 years 11 months ago
Abstract— In this paper, we propose the concept of the flexibility of design variables to Pareto-optimal solutions in MultiObjective Optimization problems. In addition, we intro...