Sciweavers

13841 search results - page 2363 / 2769
» Algorithms and Constraint Programming
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 6 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
IJCAI
2007
15 years 6 months ago
Coalitional Bargaining with Agent Type Uncertainty
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying ...
Georgios Chalkiadakis, Craig Boutilier
IJCAI
2007
15 years 6 months ago
Towards Reasoning about the Past in Neural-symbolic Systems
Reasoning about the past is of fundamental importance in several applications in computer science and artificial intelligence, including reactive systems and planning. In this pa...
Rafael V. Borges, Luís C. Lamb, Artur S. d'...
130
Voted
ISIM
2007
15 years 6 months ago
Software Architectures for Real-time Embedded Applications for Broadcasting
The paper discusses a choice of appropriate software architecture with regards to the specifications of embedded applications as information systems particularly used in area of ra...
Otto Zeleznik, Zdenek Havlice
139
Voted
SE
2008
15 years 6 months ago
Static Bug Detection Through Analysis of Inconsistent Clones
Existing software systems contain a significant amount of duplicated code. Such redundancy can negatively impact program correctness, since inconsistent updates to duplicated code ...
Elmar Jürgens, Benjamin Hummel, Florian Deiss...
« Prev « First page 2363 / 2769 Last » Next »