Sciweavers

600 search results - page 8 / 120
» Problems and results in extremal combinatorics - II
Sort
View
COCOON
2008
Springer
13 years 8 months ago
On the Complexity of Equilibria Problems in Angel-Daemon Games
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
Joaquim Gabarró, Alina García, Maria...
RE
2002
Springer
13 years 6 months ago
Extreme Programming Modified: Embrace Requirements Engineering Practices
Extreme Programming (XP) is an agile (lightweight) software development methodology and it becomes more and more popular. XP proposes many interesting practices, but it also has s...
Jerzy R. Nawrocki, Michal Jasiñski, Bartosz...
ICIP
2009
IEEE
13 years 4 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
JSAC
2010
142views more  JSAC 2010»
13 years 5 months ago
Extreme value FEC for reliable broadcasting in wireless networks
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...
Weiyao Xiao, David Starobinski
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
13 years 10 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin