4983 search results - page 275 / 997 » order 2008 |
175
click to vote
DISOPT
2008
15 years 6 months ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...
132
click to vote
DKE
2008
15 years 6 months ago
2008
Handling missing data is a critical step to ensuring good results in data mining. Like most data mining algorithms, existing privacy-preserving data mining algorithms assume data ...
153
click to vote
DM
2008
15 years 6 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
162
click to vote
DM
2008
15 years 6 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
153
click to vote
ECEASST
2008
15 years 6 months ago
2008
Executable UML allows precisely describing the software system at level of abstraction. The executable models can be translated to a less programming language completely or execute...