Sciweavers

3367 search results - page 251 / 674
» Incremental assignment problem
Sort
View
ICALP
2007
Springer
15 years 10 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret
ICAC
2005
IEEE
15 years 9 months ago
PICCIL: Interactive Learning to Support Log File Categorization
Motivated by the real-world application of categorizing system log messages into defined situation categories, this paper describes an interactive text categorization method, PICC...
David Loewenstern, Sheng Ma, Abdi Salahshour
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 9 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
ROBOCUP
2004
Springer
114views Robotics» more  ROBOCUP 2004»
15 years 9 months ago
Modular Learning System and Scheduling for Behavior Acquisition in Multi-agent Environment
The existing reinforcement learning approaches have been suffering from the policy alternation of others in multiagent dynamic environments such as RoboCup competitions since othe...
Yasutake Takahashi, Kazuhiro Edazawa, Minoru Asada
ECRTS
2003
IEEE
15 years 9 months ago
Resource Partitioning among Real-Time Applications
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
Giuseppe Lipari, Enrico Bini