Sciweavers

4103 search results - page 521 / 821
» Some results on the Collatz problem
Sort
View
MFCS
2005
Springer
16 years 3 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
MSN
2005
Springer
16 years 3 days ago
Population Estimation for Resource Inventory Applications over Sensor Networks
Abstract. The growing advance in wireless communications and electronics makes the development of low-cost and low-power sensors possible. These sensors are usually small in size a...
Jiun-Long Huang
ICCSA
2004
Springer
15 years 12 months ago
A Fast Handover Protocol for Mobile IPv6 Using Mobility Prediction Mechanism
Mobile IPv6 enables mobile node to roam transparently in any network. It shows good performance for macro mobility but it is not proper for supporting micro mobility because of lar...
Dae Sun Kim, Choong Seon Hong
JELIA
2004
Springer
15 years 12 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
189
Voted
TACAS
2004
Springer
132views Algorithms» more  TACAS 2004»
15 years 12 months ago
Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We ...
Håkan L. S. Younes, Marta Z. Kwiatkowska, Ge...