Sciweavers

2124 search results - page 147 / 425
» Aggregating time partitions
Sort
View
IWOCA
2009
Springer
119views Algorithms» more  IWOCA 2009»
15 years 10 months ago
Fully Decomposable Split Graphs
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginge...
CCCG
2007
15 years 5 months ago
Approximation Algorithms for the Minimum-Length Corridor and Related Problems
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
162
Voted
RIVF
2003
15 years 5 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
ENTCS
2008
91views more  ENTCS 2008»
15 years 4 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
107
Voted
DAC
2005
ACM
16 years 4 months ago
Multi-threaded reachability
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...