9842 search results - page 1777 / 1969 » Problem complexity |
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
121
click to vote
MKM
2009
Springer
15 years 7 months ago
2009
Springer
In this short communication we want to give an overview of how OpenMath is used in the European project “SCIEnce” [12]. The main aim of this project is to allow unified commun...
115
click to vote
OOPSLA
2009
Springer
15 years 7 months ago
2009
Springer
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
122
click to vote
SIGIR
2009
ACM
15 years 7 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
116
Voted
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...