: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
By applying web mining tools, significant patterns about the visitor behavior can be extracted from data originated in web sites. Supported by a domain expert, the patterns are v...
The cost of maintaining a software system over a long period of time far exceeds its initial development cost. Much of the maintenance cost is attributed to the time required by ne...
We propose a copula based statistical method of fitting joint cumulative returns between a market index and a stock from the index family to daily data. Modifying the method of in...
This contribution describes a general mixed-integer linear programming model based on a time-indexed formulation covering the relevant features required for the complete supply ch...