Sciweavers

4103 search results - page 161 / 821
» Some results on the Collatz problem
Sort
View
DAM
2006
136views more  DAM 2006»
15 years 6 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
108
Voted
IOR
2008
62views more  IOR 2008»
15 years 6 months ago
Improved Bounds for the Symmetric Rendezvous Value on the Line
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
Qiaoming Han, Donglei Du, Juan Vera, Luis F. Zulua...
TSMC
2008
147views more  TSMC 2008»
15 years 6 months ago
A New Approach for Solving Nonlinear Equations Systems
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
Crina Grosan, Ajith Abraham
ICTAI
1999
IEEE
15 years 11 months ago
Dynamic Email Organization via Relevance Categories
Many researchers have proposed classification systems that automatically classify email in order to reduce information overload. However, none of these systems are in use today. T...
Kenrick J. Mock
DM
2006
128views more  DM 2006»
15 years 6 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck