Sciweavers

519 search results - page 80 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
DM
2007
125views more  DM 2007»
14 years 11 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
OOPSLA
2000
Springer
15 years 3 months ago
Application isolation in the JavaTM Virtual Machine
To date, systems offering multitasking for the JavaTM programming language either use one process or one class loader for each application. Both approaches are unsatisfactory. Usi...
Grzegorz Czajkowski
EPIA
2007
Springer
15 years 5 months ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 5 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
IPPS
2006
IEEE
15 years 5 months ago
Skewed allocation of non-uniform data for broadcasting over multiple channels
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
Alan A. Bertossi, Maria Cristina Pinotti