Sciweavers

969 search results - page 58 / 194
» Programming as Problem Solving: A Participatory Theater Appr...
Sort
View
CPAIOR
2008
Springer
14 years 12 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
95
Voted
ILP
2004
Springer
15 years 3 months ago
Macro-Operators Revisited in Inductive Logic Programming
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
Érick Alphonse
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 3 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
80
Voted
AAAI
2007
15 years 14 days ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
74
Voted
DISOPT
2007
93views more  DISOPT 2007»
14 years 10 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi