463 search results - page 36 / 93 » The Most Reliable Subgraph Problem |
132
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
139
Voted
CODES
2011
IEEE
14 years 1 months ago
2011
IEEE
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
109
Voted
ICST
2010
IEEE
15 years 12 days ago
2010
IEEE
— Testing of graphical user interfaces is important due to its potential to reveal faults in operation and performance of the system under consideration. Most existing test appro...
105
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
105
click to vote
CICLING
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. With the current method of query formation, a Question Answering system retrieves a set of documents that are similar to a question, while what is mostly required is a se...