Sciweavers

3367 search results - page 355 / 674
» Incremental assignment problem
Sort
View
HYBRID
1995
Springer
15 years 8 months ago
Deciding Reachability for Planar Multi-polynomial Systems
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
Karlis Cerans, Juris Viksna
GLOBECOM
2009
IEEE
15 years 8 months ago
A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
—In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...
Dejun Yang, Xi Fang, Nan Li, Guoliang Xue
AAAI
2007
15 years 7 months ago
Learning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
Horst Samulowitz, Roland Memisevic
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
15 years 6 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
AAAI
2010
15 years 6 months ago
Generalized Task Markets for Human and Machine Computation
We discuss challenges and opportunities for developing generalized task markets where human and machine intelligence are enlisted to solve problems, based on a consideration of th...
Dafna Shahaf, Eric Horvitz